Abstract
This paper discusses vehicle routing problem involving split deliveries and pickups, in which the customer has pickup and delivery demands that can exceed the capacity of the vehicle, and one customer can be visited by no more than one vehicle or by one vehicle for no more than one time. The objective of the problem is to minimize total travel cost. A new heuristic algorithm, the competitive decision algorithm, is proposed to solve the problem. Computational experiments on the benchmark provided by Mitra are performed to evaluate our algorithm against the previously proposed method. The experiment shows that our algorithm provides the best solutions to a total of 110 problems whether or not the number of vehicles used is restricted to the minimum.
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.
