|
|
Publication
|
| Research Title |
The multi-product vehicle routing problem with cross-docking: a novel strategy hybrid bat algorithm in poultry industry |
| Date of Distribution |
28 September 2021 |
| Conference |
| Title of the Conference |
15th International Congress of Logistics and SCM Systems, Poznan, Poland |
| Organiser |
Poznan University of Technology, Faculty of Engineering Management, 2 Jacka Rychlewskiego Str. 60-965 Poznan, Poland |
| Conference Place |
15th International Congress of Logistics and SCM Systems, Poznan, Poland |
| Province/State |
|
| Conference Date |
28 September 2021 |
| To |
29 September 2021 |
| Proceeding Paper |
| Volume |
on line |
| Issue |
on line |
| Page |
on line |
| Editors/edition/publisher |
|
| Abstract |
This paper presents a novel strategy hybrid based on the Bat algorithm (NSHBA) to solve a multi-product vehicle routing problem with cross-docking and time window constraints (MPVRPCDTW) for the poultry industry with the objective of minimizing transportation costs. A mixed-integer programming model was formulated to solve this problem on a small scale. Since the problem is an NP-Hard problem, the NSHBA algorithm with neighborhood search (NS) strategies, including k-insert operator, k-swap operator, k-variable move operator, and random strategy was developed to solve medium-scale and large-scale instances. Additionally, a new disturbance algorithm (DA) was developed to find the best neighborhood strategies to increase the effectiveness of solutions in the NSHBA. The computational results revealed that the NSHBA-DA outperformed the bat algorithm (BA), the differential evolution (DE) algorithm, and the particle swarm optimization (PSO) algorithm |
| 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
|
|
|
|
|
|
|
|
|
Journal Publication
ไทย