{"id":"https://openalex.org/W7125652666","doi":"https://doi.org/10.1016/j.ejor.2026.01.036","title":"The pickup and delivery problem with time windows and scheduling on the edges","display_name":"The pickup and delivery problem with time windows and scheduling on the edges","publication_year":2026,"publication_date":"2026-01-25","ids":{"openalex":"https://openalex.org/W7125652666","doi":"https://doi.org/10.1016/j.ejor.2026.01.036"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejor.2026.01.036","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.01.036","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.ejor.2026.01.036","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5115093447","display_name":"V\u00edtor Alves Barbosa","orcid":null},"institutions":[{"id":"https://openalex.org/I126158947","display_name":"Universidade Federal da Bahia","ror":"https://ror.org/03k3p7647","country_code":"BR","type":"education","lineage":["https://openalex.org/I126158947"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"V\u00edtor A. Barbosa","raw_affiliation_strings":["Institute of Computing, Universidade Federal da Bahia, Salvador, 40170-115, BA, Brazil"],"raw_orcid":"https://orcid.org/0009-0005-9626-1655","affiliations":[{"raw_affiliation_string":"Institute of Computing, Universidade Federal da Bahia, Salvador, 40170-115, BA, Brazil","institution_ids":["https://openalex.org/I126158947"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069458453","display_name":"Sunil Tiwari","orcid":"https://orcid.org/0000-0002-0499-2794"},"institutions":[{"id":"https://openalex.org/I2801520950","display_name":"At Bristol","ror":"https://ror.org/039fp5n52","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I2801520950"]},{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Sunil Tiwari","raw_affiliation_strings":["Technology & Operations Group, University of Bristol Business School, Bristol, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0002-0499-2794","affiliations":[{"raw_affiliation_string":"Technology & Operations Group, University of Bristol Business School, Bristol, United Kingdom","institution_ids":["https://openalex.org/I36234482","https://openalex.org/I2801520950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085289673","display_name":"Rafael A. Melo","orcid":"https://orcid.org/0000-0003-4300-0097"},"institutions":[{"id":"https://openalex.org/I126158947","display_name":"Universidade Federal da Bahia","ror":"https://ror.org/03k3p7647","country_code":"BR","type":"education","lineage":["https://openalex.org/I126158947"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Rafael A. Melo","raw_affiliation_strings":["Institute of Computing, Universidade Federal da Bahia, Salvador, 40170-115, BA, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-4300-0097","affiliations":[{"raw_affiliation_string":"Institute of Computing, Universidade Federal da Bahia, Salvador, 40170-115, BA, Brazil","institution_ids":["https://openalex.org/I126158947"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5085289673"],"corresponding_institution_ids":["https://openalex.org/I126158947"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07445684,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"333","issue":"3","first_page":"788","last_page":"806"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.744700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.744700014591217,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.1256999969482422,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.03519999980926514,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.7293000221252441},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5976999998092651},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.588100016117096},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5669000148773193},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5656999945640564},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.555899977684021},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48590001463890076},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47940000891685486}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7386999726295471},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.7293000221252441},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6103000044822693},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5976999998092651},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.588100016117096},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5669000148773193},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5656999945640564},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.555899977684021},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48590001463890076},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47940000891685486},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.4691999852657318},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3465999960899353},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.34540000557899475},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.310699999332428},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2976999878883362},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27950000762939453}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.ejor.2026.01.036","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.01.036","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/1d59feeb-0fbb-486d-92ea-66540a95f5ff","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/1d59feeb-0fbb-486d-92ea-66540a95f5ff","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Barbosa, V A, Tiwari, S & Melo, R A 2026, 'The pickup and delivery problem with time windows and scheduling on the edges', European Journal of Operational Research, vol. 333, no. 3, pp. 788-806. https://doi.org/10.1016/j.ejor.2026.01.036","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/j.ejor.2026.01.036","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.01.036","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4554815208","display_name":null,"funder_award_id":"314662/2020-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G4585978986","display_name":null,"funder_award_id":"314718/2023-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5962893758","display_name":null,"funder_award_id":"PIE0002/2022","funder_id":"https://openalex.org/F4320323681","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado da Bahia"},{"id":"https://openalex.org/G6205834271","display_name":null,"funder_award_id":"445324/2024-4","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320323681","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado da Bahia","ror":"https://ror.org/0473khm44"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W1525106674","https://openalex.org/W1978020541","https://openalex.org/W1980402561","https://openalex.org/W2015282392","https://openalex.org/W2034904720","https://openalex.org/W2048314949","https://openalex.org/W2056973373","https://openalex.org/W2063659595","https://openalex.org/W2080375462","https://openalex.org/W2082772228","https://openalex.org/W2093123685","https://openalex.org/W2096305430","https://openalex.org/W2119097848","https://openalex.org/W2135419570","https://openalex.org/W2145493798","https://openalex.org/W2146870367","https://openalex.org/W2303891912","https://openalex.org/W2339713317","https://openalex.org/W2713876143","https://openalex.org/W2766585507","https://openalex.org/W2776398026","https://openalex.org/W2783688982","https://openalex.org/W2792987450","https://openalex.org/W2897648720","https://openalex.org/W2941075535","https://openalex.org/W2999537755","https://openalex.org/W3000791725","https://openalex.org/W3003257820","https://openalex.org/W3012037742","https://openalex.org/W3038322142","https://openalex.org/W3046108969","https://openalex.org/W3122055487","https://openalex.org/W3129929979","https://openalex.org/W3129951979","https://openalex.org/W3169762045","https://openalex.org/W3217284540","https://openalex.org/W4225983344","https://openalex.org/W4365148063","https://openalex.org/W4389417919"],"related_works":[],"abstract_inverted_index":{"We":[0,73,196],"introduce":[1],"the":[2,13,19,61,134,137,154,164,177,181,191,199,209,219],"Pickup":[3],"and":[4,10,25,39,70,83,86,111,118,147,187,208,246],"Delivery":[5],"Problem":[6],"with":[7,36,90,100,142,157,170,185,244],"Time":[8],"Windows":[9],"Scheduling":[11],"on":[12,136,231],"Edges":[14],"(PDPTW-SE),":[15],"a":[16,43,75,87,91],"generalization":[17],"of":[18,109,153],"PDPTW":[20],"that":[21,133],"integrates":[22],"vehicle":[23,45],"routing":[24],"machine":[26,242],"scheduling.":[27,129],"The":[28,56],"problem":[29],"involves":[30],"defining":[31],"routes":[32],"for":[33,151,201,211],"transportation":[34],"requests":[35,146],"specific":[37],"pickup":[38],"delivery":[40],"locations":[41],"using":[42],"heterogeneous":[44],"fleet,":[46],"while":[47],"machines":[48],"must":[49],"be":[50],"scheduled":[51],"to":[52,59,66,144,159,205],"traverse":[53],"certain":[54],"edges.":[55],"objective":[57],"is":[58,104],"minimize":[60],"total":[62],"completion":[63],"time":[64,68],"subject":[65],"capacity,":[67],"window,":[69],"precedence":[71],"constraints.":[72],"propose":[74],"mixed-integer":[76],"linear":[77,92],"programming":[78,93],"(MIP)":[79],"formulation,":[80],"including":[81],"preprocessing":[82],"valid":[84],"inequalities,":[85],"multi-start":[88],"heuristic":[89,165,192,210],"(LP)":[94],"improvement":[95,221],"procedure.":[96],"A":[97],"benchmark":[98],"set":[99],"two":[101],"instance":[102],"families":[103],"also":[105,217],"introduced:":[106],"(i)":[107],"coordination":[108],"pickups":[110],"deliveries":[112],"across":[113,121],"islands":[114],"requiring":[115,127],"cargo":[116],"ships,":[117],"(ii)":[119],"transport":[120],"multiple":[122],"floors,":[123],"as":[124],"in":[125,233],"hospitals,":[126],"elevator":[128],"Computational":[130],"experiments":[131],"show":[132],"solver":[135],"MIP":[138,178,200],"formulation":[139],"solves":[140],"instances":[141,156,184,203],"up":[143,158],"12":[145,160,206],"finds":[148,193],"feasible":[149,168,194],"solutions":[150,169],"95.0%":[152],"320":[155],"requests.":[161],"For":[162,180,235],"these,":[163],"consistently":[166],"provides":[167],"low":[171],"deviations,":[172],"often":[173],"matching":[174],"or":[175,213],"outperforming":[176],"results.":[179],"remaining":[182],"160":[183],"40":[186],"60":[188],"requests,":[189],"only":[190],"solutions.":[195],"thus":[197],"recommend":[198],"short-horizon":[202],"(up":[204],"requests)":[207],"larger":[212],"long-horizon":[214],"instances.":[215],"Results":[216],"highlight":[218],"LP":[220],"procedure\u2019s":[222],"relevance,":[223],"reducing":[224],"solution":[225,247],"values":[226],"by":[227],"at":[228],"least":[229],"5%":[230],"average":[232],"general.":[234],"larger,":[236],"tightly":[237],"constrained":[238],"instances,":[239],"an":[240],"additional":[241],"helps":[243],"feasibility":[245],"quality.":[248]},"counts_by_year":[],"updated_date":"2026-07-05T07:55:05.734416","created_date":"2026-01-26T00:00:00"}