Abstract
In this paper, we suggest efficient heuristics to solve a cooperative transportation planning problem that is motivated by a scenario found in the German food industry. After an appropriate decomposition of the entire problem into sub problems, we obtain a set of rich vehicle routing problems (VRP) including due dates for the delivery of the orders, capacity constraints and maximum operating time window constraints for the vehicles, and outsourcing options. Each of these sub problems is solved by a greedy heuristic that takes the distance of the locations of customers and the time window constraints into account. The greedy heuristic is further improved by applying an Ant Colony System (ACS). The suggested heuristics are assessed in a rolling horizon setting using discrete event simulation. The results of some preliminary computational experiments are provided. We show that the ACS based heuristic outperforms the greedy heuristic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
