A coevolutionary algorithm for the flexible delivery and pickup problem with time windows

This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this study...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production economics Vol. 141; no. 1; pp. 4 - 13
Main Authors: Wang, Hsiao-Fan, Chen, Ying-Yen
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.01.2013
Elsevier Sequoia S.A
Subjects:
Algorithms
Benchmarking
Bi-directional logistics
Coevolutionary algorithm
Deliveries
Delivery and pickup
Economics
Effectiveness studies
Genetic algorithms
Insertion
Integer programming
Mathematical models
Route optimization
Vehicle routing problem with backhaul
Vehicles
Windows (intervals)
Coevolutionary algorithm
Delivery and pickup
Bi-directional logistics
Vehicle routing problem with backhaul
ISSN:0925-5273, 1873-7579
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this study, therefore, a coevolutionary algorithm incorporated with a variant of the cheapest insertion method is developed to speed up the solution procedure. The FDPPTW scheme overcomes the shortcomings of the existing schemes for the delivery and pickup problems. By testing with some revised Solomon's benchmark problems, the computational results have shown the efficiency and the effectiveness of the developed algorithm. ► Both logistic services of delivery and pickup can be performed according to the customers' needs. ► Used products are recycled by the reverse logistic. ► Customers can request the services within certain time windows. ► A heuristic genetic algorithm is developed based on co-populations. ► Evaluation of efficiency and accuracy are conducted in comparative manner.
AbstractList This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this study, therefore, a coevolutionary algorithm incorporated with a variant of the cheapest insertion method is developed to speed up the solution procedure. The FDPPTW scheme overcomes the shortcomings of the existing schemes for the delivery and pickup problems. By testing with some revised Solomon's benchmark problems, the computational results have shown the efficiency and the effectiveness of the developed algorithm. [PUBLICATION ABSTRACT]
This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this study, therefore, a coevolutionary algorithm incorporated with a variant of the cheapest insertion method is developed to speed up the solution procedure. The FDPPTW scheme overcomes the shortcomings of the existing schemes for the delivery and pickup problems. By testing with some revised Solomon's benchmark problems, the computational results have shown the efficiency and the effectiveness of the developed algorithm.
This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this study, therefore, a coevolutionary algorithm incorporated with a variant of the cheapest insertion method is developed to speed up the solution procedure. The FDPPTW scheme overcomes the shortcomings of the existing schemes for the delivery and pickup problems. By testing with some revised Solomon's benchmark problems, the computational results have shown the efficiency and the effectiveness of the developed algorithm. ► Both logistic services of delivery and pickup can be performed according to the customers' needs. ► Used products are recycled by the reverse logistic. ► Customers can request the services within certain time windows. ► A heuristic genetic algorithm is developed based on co-populations. ► Evaluation of efficiency and accuracy are conducted in comparative manner.
Author Chen, Ying-Yen
Wang, Hsiao-Fan
Author_xml – sequence: 1
  givenname: Hsiao-Fan
  surname: Wang
  fullname: Wang, Hsiao-Fan
  email: hfwang@ie.nthu.edu.tw, hfwang82@hotmail.com
– sequence: 2
  givenname: Ying-Yen
  surname: Chen
  fullname: Chen, Ying-Yen
BookMark eNp9kD1v3SAUQFGVSn1J-wc6IXXpYgeweWCpSxT1S4qUpR06IQyXBhcbF_BL---L9TplyHSR7jno6lyiiyUugNBbSlpK6PF6av20QssIZS3pW0LpC3SgUnSN4GK4QAcyMN5wJrpX6DLniRAiqJQH9OMGmwinGLbi46LTX6zDz5h8eZixiwmXB8AuwB8_BsAWgj_BziwWr9782la8plhXM36sCi5-hvpabHzMr9FLp0OGN__nFfr-6eO32y_N3f3nr7c3d43puSxNx4GCY85S0WtNDTHdMEpLtCUjcMP4aLToKjByKbQFMxDtqObjMLpeuL67Qu_P_9ZLfm-Qi5p9NhCCXiBuWVEmuyM_SjlU9N0TdIpbWup1itJBHFlPKamUPFMmxZwTOGV80XuekrQPihK1N1eT2purvbkivarNq8qeqGvyc636vPThLEGtdPKQVDYeFgPWJzBF2eif0_8ByeyfAQ
CODEN IJPCEY
CitedBy_id crossref_primary_10_1016_j_eswa_2015_08_030
crossref_primary_10_1016_j_eswa_2015_12_015
crossref_primary_10_1109_ACCESS_2020_2993316
crossref_primary_10_1016_j_cie_2015_02_005
crossref_primary_10_1016_j_procir_2019_03_310
crossref_primary_10_1177_0734242X17730431
crossref_primary_10_1049_iet_its_2014_0212
crossref_primary_10_1016_j_ijpe_2012_09_004
crossref_primary_10_1016_j_jclepro_2019_02_043
crossref_primary_10_1109_ACCESS_2020_2982251
crossref_primary_10_1016_j_ijpe_2013_03_014
crossref_primary_10_1016_j_asoc_2021_107875
crossref_primary_10_1016_j_compind_2020_103275
crossref_primary_10_1016_j_ijpe_2018_05_025
crossref_primary_10_1155_2019_7436712
crossref_primary_10_1016_j_cor_2020_104987
crossref_primary_10_1016_j_ijpe_2013_05_009
crossref_primary_10_1016_j_cor_2023_106467
crossref_primary_10_1016_j_procs_2013_05_049
crossref_primary_10_21121_eab_20250309
crossref_primary_10_1016_j_omega_2023_102864
crossref_primary_10_1016_j_ijpe_2016_06_024
crossref_primary_10_1016_j_ijpe_2014_11_003
crossref_primary_10_1016_j_cie_2023_109067
crossref_primary_10_1016_j_ijpe_2012_06_009
crossref_primary_10_22395_rium_v15n28a14
crossref_primary_10_1016_j_trb_2016_12_022
Cites_doi 10.1016/j.eswa.2005.12.014
10.1007/s11301-008-0036-4
10.1016/S0305-0483(02)00056-7
10.1287/opre.35.2.254
10.1007/s11750-007-0009-0
10.1007/PL00013346
10.1287/trsc.1050.0118
10.1016/j.cie.2011.08.018
10.1007/BF02023004
10.1016/j.cor.2005.03.014
10.1016/j.cor.2009.06.001
10.1016/j.cor.2004.07.009
10.1016/j.cor.2008.04.003
10.1016/j.jenvman.2009.09.037
10.1016/j.tre.2003.12.003
10.1287/ijoc.7.1.10
10.1016/j.omega.2006.11.001
10.1057/palgrave.jors.2601935
10.1287/opre.12.4.568
10.1016/0191-2607(89)90085-X
10.1016/j.ejor.2004.09.004
10.1057/palgrave.jors.2602028
10.1016/j.ejor.2002.11.003
ContentType Journal Article
Copyright 2012 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Jan 2013
Copyright_xml – notice: 2012 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Jan 2013
DBID AAYXX
CITATION
7TA
7TB
8FD
FR3
JG9
KR7
DOI 10.1016/j.ijpe.2012.04.011
DatabaseName CrossRef
Materials Business File
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
Materials Research Database
Civil Engineering Abstracts
DatabaseTitle CrossRef
Materials Research Database
Civil Engineering Abstracts
Engineering Research Database
Technology Research Database
Mechanical & Transportation Engineering Abstracts
Materials Business File
DatabaseTitleList Materials Research Database
Materials Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Business
Economics
EISSN 1873-7579
EndPage 13
ExternalDocumentID 2824621351
10_1016_j_ijpe_2012_04_011
S0925527312001697
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFFL
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAPFB
AAQFI
AAQXK
AARIN
AAXUO
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACDAQ
ACGFO
ACGFS
ACGOD
ACIWK
ACNNM
ACRLP
ACROA
ADBBV
ADEZE
ADFHU
ADMUD
ADTZH
AEBSH
AECPX
AEFWE
AEKER
AENEX
AEYQN
AFKWA
AFODL
AFTJW
AGHFR
AGTHC
AGUBO
AGYEJ
AHHHB
AHJVU
AI.
AIEXJ
AIIAU
AIKHN
AITUG
AJBFU
AJOXV
AJWLA
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
APLSM
ASPBG
AVWKF
AXJTR
AXLSJ
AZFZN
BEHZQ
BEZPJ
BGSCR
BJAXD
BKOJK
BKOMP
BLXMC
BNTGB
BPUDD
BULVW
BZJEE
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
HAMUX
HLX
HVGLF
HZ~
IHE
IXIXF
J1W
JJJVA
KOM
LG8
LY1
LY7
M41
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SBM
SDF
SDG
SDP
SDS
SES
SET
SEW
SPC
SPCBC
SSB
SSD
SSF
SST
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
YK3
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7TA
7TB
8FD
AGCQF
FR3
JG9
KR7
ID FETCH-LOGICAL-c458t-35e1ef2fd174aa1c0c39b8d0ad0be5c25bca73f2fb587adec90af1a5b9bf47f43
ISICitedReferencesCount 31
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000312759600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5273
IngestDate Sun Sep 28 12:17:51 EDT 2025
Wed Aug 13 06:32:52 EDT 2025
Sat Nov 29 03:48:06 EST 2025
Tue Nov 18 22:13:34 EST 2025
Fri Feb 23 02:31:14 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Coevolutionary algorithm
Delivery and pickup
Bi-directional logistics
Vehicle routing problem with backhaul
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c458t-35e1ef2fd174aa1c0c39b8d0ad0be5c25bca73f2fb587adec90af1a5b9bf47f43
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 1197624110
PQPubID 45063
PageCount 10
ParticipantIDs proquest_miscellaneous_1283656889
proquest_journals_1197624110
crossref_citationtrail_10_1016_j_ijpe_2012_04_011
crossref_primary_10_1016_j_ijpe_2012_04_011
elsevier_sciencedirect_doi_10_1016_j_ijpe_2012_04_011
PublicationCentury 2000
PublicationDate 2013-01-01
PublicationDateYYYYMMDD 2013-01-01
PublicationDate_xml – month: 01
  year: 2013
  text: 2013-01-01
  day: 01
PublicationDecade 2010
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle International journal of production economics
PublicationYear 2013
Publisher Elsevier B.V
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Sequoia S.A
References Holland (bib10) 1975
Kontoravdis, Bard (bib12) 1995; 7
Ropke, Pisinger (bib19) 2006; 171
Mester, Bräysy, Dullaert (bib13) 2007; 32
Wang, Hsu (bib24) 2010; 37
Parragh, Doerner, Hartl (bib18) 2008; 58
Angelelli, Mansini (bib2) 2002
Wang, Chen (bib23) 2012; 62
Clarke, Wright (bib6) 1964; 12
Chen, Wu (bib5) 2006; 57
Bianchessi, Righini (bib4) 2007; 34
Crispim, Brandao (bib7) 2005; 56
Nagy, Salhi (bib16) 2005; 162
Solomon (bib20) 1987; 35
Berbeglia, Cordeau, Gribkovskaia, Laporte (bib3) 2007; 15
Osman (bib17) 1993; 41
Zhong, Cole (bib25) 2005; 41
Montané, Galvao (bib15) 2006; 33
Wade, Salhi (bib22) 2002; 30
Tütüncüa, Carreto, Baker (bib21) 2009; 37
Dethloff (bib9) 2001; 23
Ilgin, Gupta (bib11) 2010; 91
Dell'Amico, Righini, Salani (bib8) 2006; 40
Ai, Kachitvichyanukul (bib1) 2009; 36
Min (bib14) 1989; 23
Osman (10.1016/j.ijpe.2012.04.011_bib17) 1993; 41
Wang (10.1016/j.ijpe.2012.04.011_bib23) 2012; 62
Berbeglia (10.1016/j.ijpe.2012.04.011_bib3) 2007; 15
Ilgin (10.1016/j.ijpe.2012.04.011_bib11) 2010; 91
Holland (10.1016/j.ijpe.2012.04.011_bib10) 1975
Ropke (10.1016/j.ijpe.2012.04.011_bib19) 2006; 171
Mester (10.1016/j.ijpe.2012.04.011_bib13) 2007; 32
Dethloff (10.1016/j.ijpe.2012.04.011_bib9) 2001; 23
Min (10.1016/j.ijpe.2012.04.011_bib14) 1989; 23
Dell'Amico (10.1016/j.ijpe.2012.04.011_bib8) 2006; 40
Zhong (10.1016/j.ijpe.2012.04.011_bib25) 2005; 41
Angelelli (10.1016/j.ijpe.2012.04.011_bib2) 2002
Tütüncüa (10.1016/j.ijpe.2012.04.011_bib21) 2009; 37
Bianchessi (10.1016/j.ijpe.2012.04.011_bib4) 2007; 34
Kontoravdis (10.1016/j.ijpe.2012.04.011_bib12) 1995; 7
Clarke (10.1016/j.ijpe.2012.04.011_bib6) 1964; 12
Montané (10.1016/j.ijpe.2012.04.011_bib15) 2006; 33
Ai (10.1016/j.ijpe.2012.04.011_bib1) 2009; 36
Wang (10.1016/j.ijpe.2012.04.011_bib24) 2010; 37
Crispim (10.1016/j.ijpe.2012.04.011_bib7) 2005; 56
Chen (10.1016/j.ijpe.2012.04.011_bib5) 2006; 57
Nagy (10.1016/j.ijpe.2012.04.011_bib16) 2005; 162
Parragh (10.1016/j.ijpe.2012.04.011_bib18) 2008; 58
Solomon (10.1016/j.ijpe.2012.04.011_bib20) 1987; 35
Wade (10.1016/j.ijpe.2012.04.011_bib22) 2002; 30
References_xml – volume: 23
  start-page: 79
  year: 2001
  end-page: 96
  ident: bib9
  article-title: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up
  publication-title: OR Spectrum
– volume: 23
  start-page: 377
  year: 1989
  end-page: 386
  ident: bib14
  article-title: The multiple vehicle routing problem with simultaneous delivery and pick-up points
  publication-title: Transportation Research A
– volume: 40
  start-page: 235
  year: 2006
  end-page: 247
  ident: bib8
  article-title: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection
  publication-title: Transportation Science
– volume: 32
  start-page: 508
  year: 2007
  end-page: 517
  ident: bib13
  article-title: A multi-parametric evolution strategies algorithm for vehicle routing problems
  publication-title: Expert Systems with Applications
– volume: 30
  start-page: 479
  year: 2002
  end-page: 487
  ident: bib22
  article-title: An investigation into a new class of vehicle routing problem with backhauls
  publication-title: Omega
– volume: 35
  start-page: 254
  year: 1987
  end-page: 265
  ident: bib20
  article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints
  publication-title: Operations Research
– volume: 91
  start-page: 563
  year: 2010
  end-page: 591
  ident: bib11
  article-title: Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art
  publication-title: Journal of Environmental Management
– volume: 15
  start-page: 1
  year: 2007
  end-page: 31
  ident: bib3
  article-title: Static pickup and delivery problems: a classification scheme and survey
  publication-title: TOP
– volume: 58
  start-page: 81
  year: 2008
  end-page: 117
  ident: bib18
  article-title: A survey on pickup and delivery problems part II: transportation between pickup and delivery locations
  publication-title: Journal of Betriebswirtschaft
– volume: 36
  start-page: 1693
  year: 2009
  end-page: 1702
  ident: bib1
  article-title: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
  publication-title: Computers and Operations Research
– year: 1975
  ident: bib10
  article-title: Adaptation in Natural and Artificial Systems
– volume: 41
  start-page: 131
  year: 2005
  end-page: 144
  ident: bib25
  article-title: A vehicle routing problem with backhauls and time windows: a guided local search solution
  publication-title: Transportation Research Part E
– volume: 57
  start-page: 579
  year: 2006
  end-page: 587
  ident: bib5
  article-title: Vehicle routing problem with simultaneous deliveries and pickups
  publication-title: Journal of the Operational Research Society
– volume: 171
  start-page: 750
  year: 2006
  end-page: 775
  ident: bib19
  article-title: A unified heuristic for a large class of vehicle routing problems with backhauls
  publication-title: European Journal of Operational Research
– volume: 162
  start-page: 126
  year: 2005
  end-page: 141
  ident: bib16
  article-title: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
  publication-title: European Journal of Operational Research
– start-page: 249
  year: 2002
  end-page: 267
  ident: bib2
  article-title: The vehicle routing problem with time windows and simultaneous pickup and delivery
  publication-title: Quantitative Approaches to Distribution Logistics and Supply Chain Management (Lecture Notes in Economics and Mathematical Systems)
– volume: 56
  start-page: 1296
  year: 2005
  end-page: 1302
  ident: bib7
  article-title: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
  publication-title: Journal of the Operational Research Society
– volume: 33
  start-page: 595
  year: 2006
  end-page: 619
  ident: bib15
  article-title: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
  publication-title: Computers and Operations Research
– volume: 34
  start-page: 578
  year: 2007
  end-page: 594
  ident: bib4
  article-title: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
  publication-title: Computers and Operations Research
– volume: 7
  start-page: 10
  year: 1995
  end-page: 23
  ident: bib12
  article-title: A GRASP for the vehicle routing problem with time windows
  publication-title: ORSA Journal on Computing
– volume: 12
  start-page: 568
  year: 1964
  end-page: 581
  ident: bib6
  article-title: Scheduling of vehicles from a central depot to a number of delivery points
  publication-title: Operations Research
– volume: 37
  start-page: 138
  year: 2009
  end-page: 154
  ident: bib21
  article-title: A visual interactive approach to classical and mixed vehicle routing problems with backhauls
  publication-title: Omega
– volume: 62
  start-page: 84
  year: 2012
  end-page: 95
  ident: bib23
  article-title: A genetic algorithm for the simultaneous delivery and pickup problems with time window
  publication-title: Computers and Industrial Engineering
– volume: 41
  start-page: 421
  year: 1993
  end-page: 451
  ident: bib17
  article-title: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems
  publication-title: Annals of Operations Research
– volume: 37
  start-page: 376
  year: 2010
  end-page: 389
  ident: bib24
  article-title: A closed-loop logistic model with a spanning-tree based genetic algorithm
  publication-title: Computers and Operations Research
– volume: 32
  start-page: 508
  year: 2007
  ident: 10.1016/j.ijpe.2012.04.011_bib13
  article-title: A multi-parametric evolution strategies algorithm for vehicle routing problems
  publication-title: Expert Systems with Applications
  doi: 10.1016/j.eswa.2005.12.014
– volume: 58
  start-page: 81
  year: 2008
  ident: 10.1016/j.ijpe.2012.04.011_bib18
  article-title: A survey on pickup and delivery problems part II: transportation between pickup and delivery locations
  publication-title: Journal of Betriebswirtschaft
  doi: 10.1007/s11301-008-0036-4
– volume: 30
  start-page: 479
  year: 2002
  ident: 10.1016/j.ijpe.2012.04.011_bib22
  article-title: An investigation into a new class of vehicle routing problem with backhauls
  publication-title: Omega
  doi: 10.1016/S0305-0483(02)00056-7
– volume: 35
  start-page: 254
  issue: 2
  year: 1987
  ident: 10.1016/j.ijpe.2012.04.011_bib20
  article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints
  publication-title: Operations Research
  doi: 10.1287/opre.35.2.254
– volume: 15
  start-page: 1
  year: 2007
  ident: 10.1016/j.ijpe.2012.04.011_bib3
  article-title: Static pickup and delivery problems: a classification scheme and survey
  publication-title: TOP
  doi: 10.1007/s11750-007-0009-0
– volume: 23
  start-page: 79
  year: 2001
  ident: 10.1016/j.ijpe.2012.04.011_bib9
  article-title: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up
  publication-title: OR Spectrum
  doi: 10.1007/PL00013346
– volume: 40
  start-page: 235
  year: 2006
  ident: 10.1016/j.ijpe.2012.04.011_bib8
  article-title: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection
  publication-title: Transportation Science
  doi: 10.1287/trsc.1050.0118
– volume: 62
  start-page: 84
  year: 2012
  ident: 10.1016/j.ijpe.2012.04.011_bib23
  article-title: A genetic algorithm for the simultaneous delivery and pickup problems with time window
  publication-title: Computers and Industrial Engineering
  doi: 10.1016/j.cie.2011.08.018
– year: 1975
  ident: 10.1016/j.ijpe.2012.04.011_bib10
– volume: 41
  start-page: 421
  year: 1993
  ident: 10.1016/j.ijpe.2012.04.011_bib17
  article-title: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems
  publication-title: Annals of Operations Research
  doi: 10.1007/BF02023004
– volume: 34
  start-page: 578
  year: 2007
  ident: 10.1016/j.ijpe.2012.04.011_bib4
  article-title: Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
  publication-title: Computers and Operations Research
  doi: 10.1016/j.cor.2005.03.014
– volume: 37
  start-page: 376
  issue: 2
  year: 2010
  ident: 10.1016/j.ijpe.2012.04.011_bib24
  article-title: A closed-loop logistic model with a spanning-tree based genetic algorithm
  publication-title: Computers and Operations Research
  doi: 10.1016/j.cor.2009.06.001
– volume: 33
  start-page: 595
  issue: 3
  year: 2006
  ident: 10.1016/j.ijpe.2012.04.011_bib15
  article-title: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
  publication-title: Computers and Operations Research
  doi: 10.1016/j.cor.2004.07.009
– start-page: 249
  year: 2002
  ident: 10.1016/j.ijpe.2012.04.011_bib2
  article-title: The vehicle routing problem with time windows and simultaneous pickup and delivery
– volume: 36
  start-page: 1693
  year: 2009
  ident: 10.1016/j.ijpe.2012.04.011_bib1
  article-title: A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
  publication-title: Computers and Operations Research
  doi: 10.1016/j.cor.2008.04.003
– volume: 91
  start-page: 563
  year: 2010
  ident: 10.1016/j.ijpe.2012.04.011_bib11
  article-title: Environmentally conscious manufacturing and product recovery (ECMPRO): a review of the state of the art
  publication-title: Journal of Environmental Management
  doi: 10.1016/j.jenvman.2009.09.037
– volume: 41
  start-page: 131
  year: 2005
  ident: 10.1016/j.ijpe.2012.04.011_bib25
  article-title: A vehicle routing problem with backhauls and time windows: a guided local search solution
  publication-title: Transportation Research Part E
  doi: 10.1016/j.tre.2003.12.003
– volume: 7
  start-page: 10
  issue: 1
  year: 1995
  ident: 10.1016/j.ijpe.2012.04.011_bib12
  article-title: A GRASP for the vehicle routing problem with time windows
  publication-title: ORSA Journal on Computing
  doi: 10.1287/ijoc.7.1.10
– volume: 37
  start-page: 138
  year: 2009
  ident: 10.1016/j.ijpe.2012.04.011_bib21
  article-title: A visual interactive approach to classical and mixed vehicle routing problems with backhauls
  publication-title: Omega
  doi: 10.1016/j.omega.2006.11.001
– volume: 56
  start-page: 1296
  year: 2005
  ident: 10.1016/j.ijpe.2012.04.011_bib7
  article-title: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/palgrave.jors.2601935
– volume: 12
  start-page: 568
  year: 1964
  ident: 10.1016/j.ijpe.2012.04.011_bib6
  article-title: Scheduling of vehicles from a central depot to a number of delivery points
  publication-title: Operations Research
  doi: 10.1287/opre.12.4.568
– volume: 23
  start-page: 377
  issue: 5
  year: 1989
  ident: 10.1016/j.ijpe.2012.04.011_bib14
  article-title: The multiple vehicle routing problem with simultaneous delivery and pick-up points
  publication-title: Transportation Research A
  doi: 10.1016/0191-2607(89)90085-X
– volume: 171
  start-page: 750
  year: 2006
  ident: 10.1016/j.ijpe.2012.04.011_bib19
  article-title: A unified heuristic for a large class of vehicle routing problems with backhauls
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2004.09.004
– volume: 57
  start-page: 579
  year: 2006
  ident: 10.1016/j.ijpe.2012.04.011_bib5
  article-title: Vehicle routing problem with simultaneous deliveries and pickups
  publication-title: Journal of the Operational Research Society
  doi: 10.1057/palgrave.jors.2602028
– volume: 162
  start-page: 126
  issue: 1
  year: 2005
  ident: 10.1016/j.ijpe.2012.04.011_bib16
  article-title: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
  publication-title: European Journal of Operational Research
  doi: 10.1016/j.ejor.2002.11.003
SSID ssj0007188
Score 2.2113986
Snippet This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 4
SubjectTerms Algorithms
Benchmarking
Bi-directional logistics
Coevolutionary algorithm
Deliveries
Delivery and pickup
Economics
Effectiveness studies
Genetic algorithms
Insertion
Integer programming
Mathematical models
Route optimization
Vehicle routing problem with backhaul
Vehicles
Windows (intervals)
Title A coevolutionary algorithm for the flexible delivery and pickup problem with time windows
URI https://dx.doi.org/10.1016/j.ijpe.2012.04.011
https://www.proquest.com/docview/1197624110
https://www.proquest.com/docview/1283656889
Volume 141
WOSCitedRecordID wos000312759600002&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
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-7579
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0007188
  issn: 0925-5273
  databaseCode: AIEXJ
  dateStart: 19950301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELdKh_h4QDBAFAYyEuJlypQ0SeM8VlOrgabCQyfaJ-M4DqR0aeiX9udzV1_SdhPTeOAlshLnQ75ffOfz3e8Y-9ABJapB0Tt-W6WwQAk9J_Hj1BEZ6FvPixJjNuz659FgIEaj-Guj8b3KhVlPo6IQV1dx-V9FDedA2Jg6-w_irh8KJ6ANQocjiB2OdxJ8F_k-1vQKjIlT0x-zeb78eVmHFGbIgmlTpqYYl2E5mMpc_1qVx1Rihjy0-aWBVpHOyPiebCPft47EHfqJ0jLIIqgM5TzXVvs38k2fLXI1c_pbXJ5SisgY9KgzpuQ0ckVgWYjaFUE-xXboIKPb3vQaeDdwZCfLYEfr2oTUG_O5dS1MTvJJiZym6LgNTlyanvfIswdfZP_i_FwOe6Phx_K3g3XFcP-diqzcYwftKIxFkx10P_VGn2ttDbp5o62rT6fEKhsDeP21fzNerqnxjW0yfMqe0KKCdy0YnrGGKQ7Zgyqn4ZA9rNLPof14h4HyORt3-T5aeI0WDmjhgBZeoYVXaOGAFm7RwgktHNHCES2c0PKCXfR7w9Mzh6ptODoIxdLxQ-OZrJ2lsEZVytOu9uNEpK5K3cSEuh0mWkU-dEhCEanU6NhVmafCJE6yIMoC_yVrFrPCvGLcqKyjwdIGWxX5HWMRp7COQGanjhK-G7SYVw2j1ERFjxVRprKKOZxIHHqJQy_dQMLQt9hxfU9piVhu7R1W0pFkSloTUQKybr3vqBKlpH9nIXGnvQOWrue22Pv6MkzDuLemCjNbQR8w02FpJET8-g593rBH2__niDWX85V5y-7r9TJfzN8RRP8A5BWtsA
linkProvider Elsevier
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=A+coevolutionary+algorithm+for+the+flexible+delivery+and+pickup+problem+with+time+windows&rft.jtitle=International+journal+of+production+economics&rft.au=Wang%2C+Hsiao-Fan&rft.au=Chen%2C+Ying-Yen&rft.date=2013-01-01&rft.issn=0925-5273&rft.volume=141&rft.issue=1&rft.spage=4&rft.epage=13&rft_id=info:doi/10.1016%2Fj.ijpe.2012.04.011&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5273&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5273&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5273&client=summon