An Improved Golden Ball Algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery

A Golden Ball (IGB) algorithm was improved for the well-known vehicle routing problem, which simultaneously considers the customer demand from both delivery and pickup orders. The objective of this problem was to determine the optimal set of routes to totally satisfy both the delivery and pickup dem...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2018 IEEE ACIS 17th International Conference on Computer and Information Science (ICIS) s. 258 - 262
Hlavní autoři:	Ruttanateerawichien, Kanjana, Kurutach, Werasak
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.06.2018
Témata:	Clustering algorithms Golden Ball algorithm Heuristic algorithms Sociology Statistics Training Vehicle routing Vehicle routing problem
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	A Golden Ball (IGB) algorithm was improved for the well-known vehicle routing problem, which simultaneously considers the customer demand from both delivery and pickup orders. The objective of this problem was to determine the optimal set of routes to totally satisfy both the delivery and pickup demand of the customer population. In this paper, the Golden Ball (GB) algorithm was improved using intra-move improvement algorithms modify process selection players and coaching procedure. The aim was to find the solution that minimizes the total cost. Computational results showed that the IGB algorithm was competitive and outperforms the Golden Ball (GB) algorithm in all directions. Moreover, the best known solutions were also obtained in 67.43% of tested instances (19 out of 28).
DOI:	10.1109/ICIS.2018.8466513