학술논문
Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm.
Document Type
Journal
Author
Wang, Kefeng (PRC-HNPU-SEN) AMS Author Profile; Ye, Chunming (PRC-SUST-SB) AMS Author Profile; Ning, Aibing (PRC-SUST-SB) AMS Author Profile
Source
Subject
90 Operations research, mathematical programming -- 90B Operations research and management science
90B06Transportation, logistics
90B06
Language
English
Abstract
Summary: ``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.''