{"id":"https://openalex.org/W2057931946","doi":"https://doi.org/10.1002/net.3230260408","title":"The pickup delivery location problem on networks","display_name":"The pickup delivery location problem on networks","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2057931946","doi":"https://doi.org/10.1002/net.3230260408","mag":"2057931946"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230260408","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230260408","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004047249","display_name":"Gur Mosheiov","orcid":"https://orcid.org/0000-0002-9052-9375"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Gur Mosheiov","raw_affiliation_strings":["School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem"],"affiliations":[{"raw_affiliation_string":"School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004047249"],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.22267537,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"4","first_page":"243","last_page":"251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9986000061035156,"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/T12306","display_name":"Urban and Freight Transport Logistics","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/heuristics","display_name":"Heuristics","score":0.8548510670661926},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7509459257125854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5693076848983765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5605040192604065},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5550774931907654},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5484890341758728},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5403810143470764},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5166178345680237},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47041064500808716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4331207573413849},{"id":"https://openalex.org/keywords/lin\u2013kernighan-heuristic","display_name":"Lin\u2013Kernighan heuristic","score":0.4290475845336914},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4172895848751068},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.41348546743392944},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21048930287361145},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.20566895604133606}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8548510670661926},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7509459257125854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5693076848983765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5605040192604065},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5550774931907654},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5484890341758728},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5403810143470764},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5166178345680237},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47041064500808716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4331207573413849},{"id":"https://openalex.org/C103888782","wikidata":"https://www.wikidata.org/wiki/Q2835802","display_name":"Lin\u2013Kernighan heuristic","level":4,"score":0.4290475845336914},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4172895848751068},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.41348546743392944},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21048930287361145},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.20566895604133606},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230260408","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230260408","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W61211541","https://openalex.org/W1527658630","https://openalex.org/W1966162848","https://openalex.org/W1991798215","https://openalex.org/W2032686693","https://openalex.org/W2035544401","https://openalex.org/W2170228269","https://openalex.org/W6615941266"],"related_works":["https://openalex.org/W2031913815","https://openalex.org/W3177062893","https://openalex.org/W1992330822","https://openalex.org/W3125143773","https://openalex.org/W4297427155","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2170228269","https://openalex.org/W2975368677","https://openalex.org/W3136451934"],"abstract_inverted_index":{"Abstract":[0],"The":[1,40,68,96,124],"Pickup":[2],"Delivery":[3],"Location":[4,14],"Problem":[5,15],"(PDLP)":[6],"is":[7,42,61,70,104],"a":[8,30,33,46,73],"generalization":[9],"of":[10,32,45,76,100,160,173,182,189,203],"the":[11,19,55,133,141,147,154,161,174,183,190,204],"Traveling":[12],"Salesman":[13],"(TSLP)":[16],"in":[17,94,132,149,157,186],"which":[18],"daily":[20],"tour":[21],"involves":[22],"pickup":[23],"and":[24,51,85,102,120,144,185],"delivery":[25],"provided":[26],"to":[27,63,79,167],"customers":[28,77],"by":[29,49,66,178,199],"vehicle":[31],"given":[34],"capacity.":[35],"Two":[36],"heuristics":[37,113],"are":[38],"suggested:":[39],"first":[41,134,142],"an":[43,194],"extension":[44],"method":[47],"introduced":[48],"Simchi\u2010Levi":[50,103],"Berman":[52,101],"for":[53,82,106,140,146],"solving":[54,107],"TSLP.":[56],"Its":[57],"worst\u2010case":[58],"relative":[59,126],"error":[60,127],"shown":[62],"be":[64],"bounded":[65],"1.":[67],"second":[69],"based":[71],"on":[72,109,116],"simple":[74],"ranking":[75],"according":[78],"their":[80,86],"probabilities":[81],"positive":[83],"demand":[84],"weighted":[87],"average":[88,125],"distances":[89],"from":[90],"all":[91,129],"other":[92],"locations.":[93],"addition,":[95],"fully":[97],"polynomial":[98],"algorithm":[99],"extended":[105],"PDLPs":[108],"tree":[110,122,162],"networks.":[111,123],"Both":[112],"were":[114],"tested":[115],"small\u2010size":[117],"general":[118],"networks":[119],"medium\u2010size":[121],"over":[128],"test":[130],"problems":[131,164],"class":[135],"did":[136],"not":[137],"exceed":[138],"2.5%":[139],"heuristic":[143],"1%":[145],"second.":[148],"most":[150],"cases,":[151],"both":[152],"produced":[153],"optimal":[155],"solution.":[156],"about":[158,187],"56%":[159],"network":[163],"(with":[165],"up":[166],"80":[168],"nodes),":[169],"Theoptimal":[170,192],"home":[171],"location":[172],"server":[175],"was":[176,197],"found":[177,198],"at":[179,200],"least":[180,201],"one":[181,202],"heuristics,":[184],"94%":[188],"problems,":[191],"or":[193],"adjacent":[195],"node":[196],"heuristics.":[205]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}