A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem
Efficiency in logistics is often affected by the fair distribution of the customers along the routes and the available depots for goods delivery. From this perspective, in this study, the Multi-depot Vehicle Routing Problem (MDVRP), by considering two objectives, is addressed. The two objec...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2024-01-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Online Access: | http://www.growingscience.com/ijiec/Vol15/IJIEC_2023_38.pdf |
| _version_ | 1797379832714100736 |
|---|---|
| author | Andrés Arias Londoño Walter Gil González Oscar Danilo Montoya Giraldo John Wilmer Escobar |
| author_facet | Andrés Arias Londoño Walter Gil González Oscar Danilo Montoya Giraldo John Wilmer Escobar |
| author_sort | Andrés Arias Londoño |
| collection | DOAJ |
| description | Efficiency in logistics is often affected by the fair distribution of the customers along the routes and the available depots for goods delivery. From this perspective, in this study, the Multi-depot Vehicle Routing Problem (MDVRP), by considering two objectives, is addressed. The two objectives in conflict for MDVRP are the distance traveled by vehicles and the standard deviation of the routes’ length. A significant standard deviation value provides a small distance traveled by vehicles, translated into unbalanced routes. We have used a weighted average objective function involving the two objectives. A Variable Neighborhood Search algorithm within a Chu-Beasley Genetic Algorithm has been proposed to solve the problem. For decision-making purposes, several values are chosen for the weight factors multiplying the terms at the objective function to build up a non-dominated front of solutions. The methodology is tested in large-size instances for the MDVRP, reporting noticeable results for managerial insights. |
| first_indexed | 2024-03-08T20:28:44Z |
| format | Article |
| id | doaj.art-24cb22c80ab944f8b8c74167fb3d7c31 |
| institution | Directory Open Access Journal |
| issn | 1923-2926 1923-2934 |
| language | English |
| last_indexed | 2024-03-08T20:28:44Z |
| publishDate | 2024-01-01 |
| publisher | Growing Science |
| record_format | Article |
| series | International Journal of Industrial Engineering Computations |
| spelling | doaj.art-24cb22c80ab944f8b8c74167fb3d7c312023-12-22T14:28:38ZengGrowing ScienceInternational Journal of Industrial Engineering Computations1923-29261923-29342024-01-0115133735410.5267/j.ijiec.2023.9.006A hybrid heuristic approach for the multi-objective multi depot vehicle routing problemAndrés Arias LondoñoWalter Gil GonzálezOscar Danilo Montoya GiraldoJohn Wilmer Escobar Efficiency in logistics is often affected by the fair distribution of the customers along the routes and the available depots for goods delivery. From this perspective, in this study, the Multi-depot Vehicle Routing Problem (MDVRP), by considering two objectives, is addressed. The two objectives in conflict for MDVRP are the distance traveled by vehicles and the standard deviation of the routes’ length. A significant standard deviation value provides a small distance traveled by vehicles, translated into unbalanced routes. We have used a weighted average objective function involving the two objectives. A Variable Neighborhood Search algorithm within a Chu-Beasley Genetic Algorithm has been proposed to solve the problem. For decision-making purposes, several values are chosen for the weight factors multiplying the terms at the objective function to build up a non-dominated front of solutions. The methodology is tested in large-size instances for the MDVRP, reporting noticeable results for managerial insights.http://www.growingscience.com/ijiec/Vol15/IJIEC_2023_38.pdf |
| spellingShingle | Andrés Arias Londoño Walter Gil González Oscar Danilo Montoya Giraldo John Wilmer Escobar A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem International Journal of Industrial Engineering Computations |
| title | A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem |
| title_full | A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem |
| title_fullStr | A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem |
| title_full_unstemmed | A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem |
| title_short | A hybrid heuristic approach for the multi-objective multi depot vehicle routing problem |
| title_sort | hybrid heuristic approach for the multi objective multi depot vehicle routing problem |
| url | http://www.growingscience.com/ijiec/Vol15/IJIEC_2023_38.pdf |
| work_keys_str_mv | AT andresariaslondono ahybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT waltergilgonzalez ahybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT oscardanilomontoyagiraldo ahybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT johnwilmerescobar ahybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT andresariaslondono hybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT waltergilgonzalez hybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT oscardanilomontoyagiraldo hybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem AT johnwilmerescobar hybridheuristicapproachforthemultiobjectivemultidepotvehicleroutingproblem |