본문 바로가기
[학술저널]

  • 학술저널

Nader Al Theeb(Jordan University of Science Technology) Mohammed Hayajneh(Jordan University of Science Technology) Naqaa AL Qubelat(Jordan University of Science Technology)

DOI : 10.7232/iems.2020.19.4.774

표지

북마크 0

리뷰 0

이용수 1

피인용수 0

초록

A new optimization model and solution approach for the Electric Vehicle Routing Problem (EVRP) is presented in this research, where the electric vehicles are used to deliver the products from manufacturing plant to multiple customers through a split delivery system which allows vehicles to partially recharged and return to a depot to get more loads if needed. The proposed model is a Mixed Integer Linear Programming (MILP) model used to determine the optimal route achieving the desired objective function for each vehicle which ensures maximization of customer satisfaction by minimizing total amount deviations and minimization of total distribution time. CPLEX solver is used to solving the different sizes of data sets to test the performance of the model, while a new heuristic approach is constructed to solve the same data sets. Then the results of the heuristic are compared with those obtained by CPLEX. The results of the small size data sets show that the CPLEX and heuristic obtain a competitive solution in terms of both computation time and solution quality. For medium-size data sets, the proposed heuristic can find the same or better solution for some of them compared with the result produced by CPLEX.

목차

ABSTRACT
1. INTRODUCTION
2. RELATED LITERATURE
3. PROBLEM DESCRIPTION AND MATHEMATICAL FORMULATION
4. HEURISTIC SOLUTION APPROACH
5. NUMERICAL ANALYSIS
6. CASE STUDY
7. CONCLUSIONS
REFERENCES

참고문헌(0)

리뷰(0)

도움이 되었어요.0

도움이 안되었어요.0

첫 리뷰를 남겨주세요.
DBpia에서 서비스 중인 논문에 한하여 피인용 수가 반영됩니다.
인용된 논문이 DBpia에서 서비스 중이라면, 아래 [참고문헌 신청]을 통해서 등록해보세요.
Insert title here