Efficient algorithms for optimal pickup-point selection in the selective pickup and delivery problem with time-window constraints

We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at stores and deliver them to customers so as to minimize the total distance of the routes under capacity and time-window constraints. In this pape...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of advanced mechanical design, systems, and manufacturing Ročník 14; číslo 5; s. JAMDSM0074
Hlavní autori: Yosuke TAKADA, Masaru SHIMAZAKI, Yannan HU, Mutsunori YAGIURA
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: The Japan Society of Mechanical Engineers 01.01.2020
Predmet:
dynamic programming
selective pickup and delivery problem
vehicle routing problem
ISSN:1881-3054
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at stores and deliver them to customers so as to minimize the total distance of the routes under capacity and time-window constraints. In this paper, to design a local search method for this problem, we consider the following: Given the order of customers in a route, we determine the pickup stores and optimal times of visiting at customers so that the total distance is minimized. This is called the optimal pickup point problem and is a subproblem of the selective pickup and delivery problem with time-window constraints. We show that the optimal pickup point problem is NP-hard in general, and then we propose dynamic programmingmethods, which can obtain upper and lower bounds in linear time, and optimal solution in pseudo-polynomial time.
AbstractList We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at stores and deliver them to customers so as to minimize the total distance of the routes under capacity and time-window constraints. In this paper, to design a local search method for this problem, we consider the following: Given the order of customers in a route, we determine the pickup stores and optimal times of visiting at customers so that the total distance is minimized. This is called the optimal pickup point problem and is a subproblem of the selective pickup and delivery problem with time-window constraints. We show that the optimal pickup point problem is NP-hard in general, and then we propose dynamic programmingmethods, which can obtain upper and lower bounds in linear time, and optimal solution in pseudo-polynomial time.
Author Yannan HU
Yosuke TAKADA
Masaru SHIMAZAKI
Mutsunori YAGIURA
Author_xml – sequence: 1
  fullname: Yosuke TAKADA
  organization: Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University
– sequence: 2
  fullname: Masaru SHIMAZAKI
  organization: Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University
– sequence: 3
  fullname: Yannan HU
  organization: Department of Applied Mathematics, Tokyo University of Science
– sequence: 4
  fullname: Mutsunori YAGIURA
  organization: Department of Mathematical Informatics, Graduate School of Informatics, Nagoya University
BookMark eNo1j8tKAzEARYMo2FY_QcgPTM1jMpkspVQtFNzoesjk0abOJEMSLV365wZbV_dyuBy4c3DtgzcAPGC0xESIx4McdRqXBBF0rgjx-grMcNviiiJW34J5SgeEGoFqPAM_a2udcsZnKIddiC7vxwRtiDBM2Y1ygJNTn19TNQVXNskMRmUXPHQe5r35B9_msoPSa6jNUEg8wSmGfjAjPBYtLDpTHZ3X4QhV8ClHWZTpDtxYOSRzf8kF-Hhev69eq-3by2b1tK0UI22ulGYKUaE1F0QziakRmGJOmhZLQq3hljCihEVKotaqmhLGmOCtEITgnkm6AJuzVwd56KZYzsVTF6Tr_kCIu07G7NRgOtIXFakxt4jUPbK95IzJRjSqNFor-gslDHRW
CitedBy_id crossref_primary_10_3390_su16041698
ContentType Journal Article
DBID DOA
DOI 10.1299/jamdsm.2020jamdsm0074
DatabaseName DOAJ Open Access Full Text
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ : Directory of Open Access Journals [open access]
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1881-3054
EndPage JAMDSM0074
ExternalDocumentID oai_doaj_org_article_2b52c2417f024b0fba755a696cba734c
GroupedDBID 2WC
5GY
AENEX
ALMA_UNASSIGNED_HOLDINGS
CS3
DU5
E3Z
GROUPED_DOAJ
JSF
JSH
KQ8
OK1
RJT
RZJ
ID FETCH-LOGICAL-c528t-cd5c039dd792d5a13e913172681a23fe7f252c9f0ca08fc43255597899221b5a3
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000545987000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Fri Oct 03 12:50:22 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c528t-cd5c039dd792d5a13e913172681a23fe7f252c9f0ca08fc43255597899221b5a3
OpenAccessLink https://doaj.org/article/2b52c2417f024b0fba755a696cba734c
ParticipantIDs doaj_primary_oai_doaj_org_article_2b52c2417f024b0fba755a696cba734c
PublicationCentury 2000
PublicationDate 2020-01-01
PublicationDateYYYYMMDD 2020-01-01
PublicationDate_xml – month: 01
  year: 2020
  text: 2020-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Journal of advanced mechanical design, systems, and manufacturing
PublicationYear 2020
Publisher The Japan Society of Mechanical Engineers
Publisher_xml – name: The Japan Society of Mechanical Engineers
SSID ssj0069041
Score 2.1362908
Snippet We address the selective pickup and delivery problem with time-window constraints, which is a problem of finding vehicle routes that pick up commodities at...
SourceID doaj
SourceType Open Website
StartPage JAMDSM0074
SubjectTerms dynamic programming
selective pickup and delivery problem
vehicle routing problem
Title Efficient algorithms for optimal pickup-point selection in the selective pickup and delivery problem with time-window constraints
URI https://doaj.org/article/2b52c2417f024b0fba755a696cba734c
Volume 14
WOSCitedRecordID wos000545987000010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxQAD4ine8sBq4SS2E4-AWjFVDCB1q-yzDRU0qZo-xMg_55ykEkwsbJbl2NKdc3efZX8fITcShLRWKmZ9zpkIgjMDQrFE-GABPIgMGrGJfDgsRiP99EPqK94Ja-mBW8PdplamgGkmD5hNLA_W5FIapRVgKxMQoy_P9QZMtTEYIZ9Iuvc6GG8jx5Cr47vzlLfNmDl_sfQ36WSwT_a6OpDetesfkC1fHpLdH-yAR-Sr39A7YFag5uO1QhT_Nq0pFpm0wv98il_PJvC-nLFZNcExdaNog2amk5JiWbfpWPluHDWlo85_xJsYn7RTkqHxIJZGhXm2RnherSnEijEKRyzqY_Iy6D8_PLJOMYGBTIsFAyeBZ9q5XKdOmiTzOsECIVVFYtIs-DykaE0dOBheBPQDAgpEFEUkp02sNNkJ6ZVV6U8JTRLluQigAkcrZ0Fb4XWGkV06pXJnzsh9tN541pJijCNNddOBzht3zhv_5bzz_5jkguxEx7bnIpekt5gv_RXZhtViUs-vm33xDU77wyU
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+algorithms+for+optimal+pickup-point+selection+in+the+selective+pickup+and+delivery+problem+with+time-window+constraints&rft.jtitle=Journal+of+advanced+mechanical+design%2C+systems%2C+and+manufacturing&rft.au=Yosuke+TAKADA&rft.au=Masaru+SHIMAZAKI&rft.au=Yannan+HU&rft.au=Mutsunori+YAGIURA&rft.date=2020-01-01&rft.pub=The+Japan+Society+of+Mechanical+Engineers&rft.eissn=1881-3054&rft.volume=14&rft.issue=5&rft.spage=JAMDSM0074&rft.epage=JAMDSM0074&rft_id=info:doi/10.1299%2Fjamdsm.2020jamdsm0074&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_2b52c2417f024b0fba755a696cba734c