Abstract
This paper deals with the pollution-routing problem with simultaneous pickup and delivery, where the goal is to minimize fuel consumption and emissions by scheduling and routing customers. A nonlinear mix integer programing model is presented for this problem, and an adaptive large neighborhood search heuristic is proposed for the solution method including new removal and insertion operators. Also a heuristic algorithm is proposed to construct the initial solution. The proposed method is validated by computational experiments conducted on two classes of benchmark instances. The experiments further show that our proposed heuristic outperforms related heuristics and improved the results of existing literature.
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.
