Abstract
Considering simultaneous pick-ups and deliveries, we present a model of local container vehicle routing with soft time window and capacity constraints. A genetic algorithm is developed by improving solution encoding, its operators and involution strategy. Based on the Solomon's customer problem, experiments show that the proposed model and algorithm are potentially efficient and useful in solving container forwarder vehicle routing problems with simultaneous pick-up and delivery service.
Sign-in/Register to access full text options 
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.
