The Library
Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery
Tools
Majidi, Setareh, Hosseini-Motlagh, Seyyed-Mahdi and Ignatius, Joshua (2017) Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery. Soft Computing . pp. 1-15. doi:10.1007/s00500-017-2535-5 ISSN 1432-7643.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: https://doi.org/10.1007/s00500-017-2535-5
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.
Item Type: | Journal Article | ||||||
---|---|---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Engineering > WMG (Formerly the Warwick Manufacturing Group) | ||||||
Journal or Publication Title: | Soft Computing | ||||||
Publisher: | Springer | ||||||
ISSN: | 1432-7643 | ||||||
Official Date: | 2017 | ||||||
Dates: |
|
||||||
Page Range: | pp. 1-15 | ||||||
DOI: | 10.1007/s00500-017-2535-5 | ||||||
Status: | Peer Reviewed | ||||||
Publication Status: | Published | ||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |