乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T10:39:12Z","timestamp":1726310352869},"reference-count":31,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2020,8,1]],"date-time":"2020-08-01T00:00:00Z","timestamp":1596240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1016\/j.ejor.2020.01.040","type":"journal-article","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T02:47:36Z","timestamp":1579920456000},"page":"906-919","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"title":["Exact algorithms for the multi-pickup and delivery problem with time windows"],"prefix":"10.1016","volume":"284","author":[{"given":"Imadeddine","family":"Aziez","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"C\u00f4t\u00e9","sequence":"additional","affiliation":[]},{"given":"Leandro C.","family":"Coelho","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.ejor.2020.01.040_bib0001","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1016\/j.cor.2008.04.003","article-title":"A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery","volume":"36","author":"Ai","year":"2009","journal-title":"Computers & Operations Research"},{"issue":"1-4","key":"10.1016\/j.ejor.2020.01.040_bib0002","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/B:ANOR.0000004765.69773.41","article-title":"On dual based lower bounds for the sequential ordering problem with precedences and due dates","volume":"124","author":"Alonso-Ayuso","year":"2003","journal-title":"Annals of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.040_bib0003","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/PL00011432","article-title":"Solving the asymmetric travelling salesman problem with time windows by branch-and-cut","volume":"90","author":"Ascheuer","year":"2001","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.040_bib0004","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008779125567","article-title":"A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints","volume":"17","author":"Ascheuer","year":"2000","journal-title":"Computational Optimization and Applications"},{"issue":"1-3","key":"10.1016\/j.ejor.2020.01.040_bib0005","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01585767","article-title":"The precedence-constrained asymmetric traveling salesman polytope","volume":"68","author":"Balas","year":"1995","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.040_bib0006","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/opre.1100.0881","article-title":"An exact algorithm for the pickup and delivery problem with time windows","volume":"59","author":"Baldacci","year":"2011","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.040_bib0007","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1016\/j.ejor.2019.06.032","article-title":"A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities","volume":"279","author":"Bettinelli","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2020.01.040_bib0008","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1287\/trsc.2014.0535","article-title":"Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and last-in-first-out loading","volume":"49","author":"Cherkesly","year":"2014","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2020.01.040_bib0009","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","article-title":"A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading","volume":"62","author":"Cherkesly","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.040_bib0010","first-page":"79","article-title":"Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015","volume":"54","author":"Coelho","year":"2016","journal-title":"INFOR: Information Systems and Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.040_bib0011","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","article-title":"A branch-and-cut algorithm for the dial-a-ride problem","volume":"54","author":"Cordeau","year":"2006","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2020.01.040_bib0012","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.cor.2019.04.023","article-title":"The pickup and delivery problem with time windows and occasional drivers","volume":"109","author":"Dahle","year":"2019","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.040_bib0013","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(88)90333-5","article-title":"An inexact algorithm for the sequential ordering problem","volume":"37","author":"Escudero","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.01.040_sbref0014","series-title":"Proceedings of the IEEE symposium on swarm intelligence","first-page":"1","article-title":"An extended EigenAnt colony system applied to the sequential ordering problem","author":"Ezzat","year":"2014"},{"issue":"4","key":"10.1016\/j.ejor.2020.01.040_bib0015","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/j.orl.2017.04.013","article-title":"Pickup and delivery problem with time windows: a new compact two-index formulation","volume":"45","author":"Furtado","year":"2017","journal-title":"Operations Research Letters"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.040_bib0016","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/j.ejor.2019.05.010","article-title":"Granular tabu search for the pickup and delivery problem with time windows and electric vehicles","volume":"278","author":"Goeke","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.040_bib0017","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.cie.2012.01.005","article-title":"A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery","volume":"65","author":"Goksal","year":"2013","journal-title":"Computers & Industrial Engineering"},{"issue":"5","key":"10.1016\/j.ejor.2020.01.040_bib0018","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/S0167-8191(03)00048-6","article-title":"A cooperative parallel rollout algorithm for the sequential ordering problem","volume":"29","author":"Guerriero","year":"2003","journal-title":"Parallel Computing"},{"issue":"4","key":"10.1016\/j.ejor.2020.01.040_bib0019","doi-asserted-by":"crossref","first-page":"1132","DOI":"10.1016\/j.cor.2012.11.017","article-title":"Efficient symmetry breaking formulations for the job grouping problem","volume":"40","author":"Jans","year":"2013","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.040_bib0020","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2015.11.001","article-title":"Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem","volume":"251","author":"Letchford","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.040_bib0021","first-page":"160","article-title":"A metaheuristic for the pickup and delivery problem with time windows","volume":"12","author":"Li","year":"2001","journal-title":"International Journal of Artificial Intelligence Tools"},{"issue":"2","key":"10.1016\/j.ejor.2020.01.040_bib0022","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","article-title":"A new branch-and-cut algorithm for the capacitated vehicle routing problem","volume":"100","author":"Lysgaard","year":"2004","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.040_bib0023","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/j.ejor.2018.01.035","article-title":"The multi-pickup and delivery problem with time windows","volume":"269","author":"Naccache","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"10.1016\/j.ejor.2020.01.040_bib0024","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","article-title":"A general heuristic for vehicle routing problems","volume":"34","author":"Pisinger","year":"2007","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2020.01.040_bib0025","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","article-title":"Branch and cut and price for the pickup and delivery problem with time windows","volume":"43","author":"Ropke","year":"2009","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2020.01.040_bib0026","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","article-title":"Models and branch-and-cut algorithms for pickup and delivery problems with time windows","volume":"49","author":"Ropke","year":"2007","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2020.01.040_bib0027","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","article-title":"An efficient implementation of local search algorithms for constrained routing problems","volume":"47","author":"Savelsbergh","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2020.01.040_bib0028","series-title":"Proceedings of the Genetic and evolutionary computation conference","first-page":"669","article-title":"A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem","author":"Seo","year":"2003"},{"issue":"11","key":"10.1016\/j.ejor.2020.01.040_bib0029","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","article-title":"A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery","volume":"37","author":"Subramanian","year":"2010","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.01.040_bib0030","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.cor.2016.07.014","article-title":"The pickup and delivery problem with time windows and handling operations","volume":"77","author":"Veenstra","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.ejor.2020.01.040_bib0031","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.cie.2015.02.005","article-title":"A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup\u2013delivery and time windows","volume":"83","author":"Wang","year":"2015","journal-title":"Computers & Industrial Engineering"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720300771?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221720300771?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T00:06:10Z","timestamp":1604361970000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221720300771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["S0377221720300771"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2020.01.040","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2020,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Exact algorithms for the multi-pickup and delivery problem with time windows","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2020.01.040","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Crown Copyright \u00a9 2020 Published by Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}