| Research Title |
The Nearest Neighbor Heuristic for the Multi - Products Capacitated Vehicle Routing Problem:
A Case Study of the Ice Industry
|
| Date of Distribution |
23 January 2017 |
| Conference |
| Title of the Conference |
SIMMOD 2017 International Conference on Simulation and Modelling |
| Organiser |
มหาวิทยาลัยขอนแก่น สถาบันเทคโนโลยีแห่งเอเชีย มหาวิทยาลัยอุบลราชธานี มหาวิทยาลัยเชียงใหม่ |
| Conference Place |
โรงแรมจอมเทียน ปาล์ม บีช |
| Province/State |
ชลบุรี |
| Conference Date |
23 January 2017 |
| To |
25 January 2017 |
| Proceeding Paper |
| Volume |
2017 |
| Issue |
1 |
| Page |
60 |
| Editors/edition/publisher |
|
| Abstract |
This paper proposes the capacitated vehicle routing problem for multiple products (CVRPMP) and a heterogeneous fleet in the ice delivery industry. The structure problem pattern is the CVRPMP One-to-Many (1-M) where each customer has a variety of product types and demands. We develop a mixed integer linear programming (MILP) model for optimal solution and propose the nearest neighbor heuristic (NNH) in the ice industry. The objective is to sequence the delivery of vehicles for the ice industry to minimize total cost, consisting of fuel cost and driver wage cost. To validate the proposed heuristic, its solutions are compared with the optimal solution. The results show that the nearest neighbor heuristic is efficient. |
| Author |
|
| Peer Review Status |
มีผู้ประเมินอิสระ |
| Level of Conference |
นานาชาติ |
| Type of Proceeding |
Full paper |
| Type of Presentation |
Oral |
| Part of thesis |
true |
| Presentation awarding |
false |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย