A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
This paper considers a transportation problem for moving empty or laden containers for a logistic company. Owing to the limited resource of its vehicles (trucks and trailers), the company often needs to sub-contract certain job orders to outsourced companies. A model for this truck and trailer vehic...
Saved in:
| Published in | European journal of operational research Vol. 172; no. 3; pp. 855 - 885 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
01.08.2006
Elsevier Elsevier Sequoia S.A |
| Series | European Journal of Operational Research |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0377-2217 1872-6860 1872-6860 |
| DOI | 10.1016/j.ejor.2004.11.019 |
Cover
| Abstract | This paper considers a transportation problem for moving empty or laden containers for a logistic company. Owing to the limited resource of its vehicles (trucks and trailers), the company often needs to sub-contract certain job orders to outsourced companies. A model for this truck and trailer vehicle routing problem (TTVRP) is first constructed in the paper. The solution to the TTVRP consists of finding a complete routing schedule for serving the jobs with minimum routing distance and number of trucks, subject to a number of constraints such as time windows and availability of trailers. To solve such a multi-objective and multi-modal combinatorial optimization problem, a hybrid multi-objective evolutionary algorithm (HMOEA) featured with specialized genetic operators, variable-length representation and local search heuristic is applied to find the Pareto optimal routing solutions for the TTVRP. Detailed analysis is performed to extract useful decision-making information from the multi-objective optimization results as well as to examine the correlations among different variables, such as the number of trucks and trailers, the trailer exchange points, and the utilization of trucks in the routing solutions. It has been shown that the HMOEA is effective in solving multi-objective combinatorial optimization problems, such as finding useful trade-off solutions for the TTVRP routing problem. |
|---|---|
| AbstractList | This paper considers a transportation problem for moving empty or laden containers for a logistic company. Owing to the limited resource of its vehicles (trucks and trailers), the company often needs to sub-contract certain job orders to outsourced companies. A model for this truck and trailer vehicle routing problem (TTVRP) is first constructed in the paper. The solution to the TTVRP consists of finding a complete routing schedule for serving the jobs with minimum routing distance and number of trucks, subject to a number of constraints such as time windows and availability of trailers. To solve such a multi-objective and multi-modal combinatorial optimization problem, a hybrid multi-objective evolutionary algorithm (HMOEA) featured with specialized genetic operators, variable-length representation and local search heuristic is applied to find the Pareto optimal routing solutions for the TTVRP. Detailed analysis is performed to extract useful decision-making information from the multi-objective optimization results as well as to examine the correlations among different variables, such as the number of trucks and trailers, the trailer exchange points, and the utilization of trucks in the routing solutions. It has been shown that the HMOEA is effective in solving multi-objective combinatorial optimization problems, such as finding useful trade-off solutions for the TTVRP routing problem. This paper considers a transportation problem for moving empty or laden containers for a logistic company. Owing to the limited resource of its vehicles (trucks and trailers), the company often needs to sub-contract certain job orders to outsourced companies. A model for this truck and trailer vehicle routing problem (TTVRP) is first constructed in the paper. The solution to the TTVRP consists of finding a complete routing schedule for serving the jobs with minimum routing distance and number of trucks, subject to a number of constraints such as time windows and availability of trailers. To solve such a multi-objective and multi-modal combinatorial optimization problem, a hybrid multi-objective evolutionary algorithm (HMOEA) featured with specialized genetic operators, variable-length representation and local search heuristic is applied to find the Pareto optimal routing solutions for the TTVRP. Detailed analysis is performed to extract useful decision-making information from the multi-objective optimization results as well as to examine the correlations among different variables, such as the number of trucks and trailers, the trailer exchange points, and the utilization of trucks in the routing solutions. It has been shown that the HMOEA is effective in solving multi-objective combinatorial optimization problems, such as finding useful trade-off solutions for the TTVRP routing problem. [PUBLICATION ABSTRACT] |
| Author | Lee, L.H. Chew, Y.H. Tan, K.C. |
| Author_xml | – sequence: 1 givenname: K.C. surname: Tan fullname: Tan, K.C. email: eletankc@nus.edu.sg organization: Department of Electrical and Computer Engineering, National University of Singapore, 4, Engineering Drive 3, Singapore 117576, Singapore – sequence: 2 givenname: Y.H. surname: Chew fullname: Chew, Y.H. organization: Department of Electrical and Computer Engineering, National University of Singapore, 4, Engineering Drive 3, Singapore 117576, Singapore – sequence: 3 givenname: L.H. surname: Lee fullname: Lee, L.H. organization: Department of Industrial and System Engineering, National University of Singapore, 10 Kent Ridge Crescent, Singapore 119260, Singapore |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17652945$$DView record in Pascal Francis http://econpapers.repec.org/article/eeeejores/v_3a172_3ay_3a2006_3ai_3a3_3ap_3a855-885.htm$$DView record in RePEc |
| BookMark | eNqNUstq3DAUNSWFTtL-QFem0KUdPayHoZsQ-iKBbtq10MjXGbmyNZVsl_n73qlDC12ECo6uFuccXZ2ry-JiihMUxWtKakqovB5qGGKqGSFNTWlNaPus2FGtWCW1JBfFjnClKsaoelFc5jwQQqigYlf0N-XhtE--K8clzL6K-wHc7FcoYY1hmX2cbDqVNjzE5OfDWPYxlTmG1U8P5ZwW9720U4cn6wOkcoWDdwHKFFGKjGOK-wBjflk8723I8OqxXhXfPrz_evupuv_y8fPtzX3lhG7nyra94lL0lIPl2jYtkcwJxTrN95JZqaCXXdu1zgkOTNHWEmtpzztJNNda8auCb77LdLSnnzYEc0x-xCcYSsw5KjOYc1TmHJWh1GBUqHqzqbDdHwvk2QxxSRM2irSGKS1kg6S7jZTgCO6PLeBCP8hmNdxSxXA_IdBfYvEIjjgitBBGa2EO84hubx-vtNnZ0Cc7OZ__NqukYG0jkMc2nksx5wT9_71H_yNyfrbnWf6e09PSd5sUcEqrh2Sy8zA56HzCj2G66J-S_wKNjMue |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1016_j_tre_2015_08_008 crossref_primary_10_1080_13675567_2014_986443 crossref_primary_10_1007_s10732_015_9280_7 crossref_primary_10_1109_TITS_2020_2991098 crossref_primary_10_3390_su10114257 crossref_primary_10_1016_j_tre_2022_102922 crossref_primary_10_1016_j_cie_2014_10_029 crossref_primary_10_3390_app142210185 crossref_primary_10_1287_ijoc_1080_0312 crossref_primary_10_1109_TITS_2019_2910274 crossref_primary_10_1016_j_aasri_2012_11_113 crossref_primary_10_1287_inte_1090_0475 crossref_primary_10_1016_j_asoc_2018_07_014 crossref_primary_10_1016_j_swevo_2011_06_002 crossref_primary_10_1016_j_tre_2023_103097 crossref_primary_10_1287_trsc_2018_0836 crossref_primary_10_1016_j_ejor_2014_01_023 crossref_primary_10_1109_TITS_2021_3119080 crossref_primary_10_1057_palgrave_jors_2602409 crossref_primary_10_3390_su152316149 crossref_primary_10_5687_iscie_24_287 crossref_primary_10_1108_03321640910992056 crossref_primary_10_1016_j_eswa_2011_04_061 crossref_primary_10_1016_j_dam_2018_07_033 crossref_primary_10_3233_JIFS_222267 crossref_primary_10_1007_s00500_015_1830_2 crossref_primary_10_1016_j_cie_2023_109238 crossref_primary_10_1007_s10479_022_04816_y crossref_primary_10_1016_j_tre_2013_12_012 crossref_primary_10_1016_j_aei_2013_08_001 crossref_primary_10_1016_j_ejor_2017_04_046 crossref_primary_10_1109_ACCESS_2020_3001435 crossref_primary_10_1109_JSYST_2016_2601058 crossref_primary_10_1016_j_cor_2017_01_020 crossref_primary_10_1016_j_ejor_2007_05_055 crossref_primary_10_1016_j_tre_2018_06_005 crossref_primary_10_1109_TCYB_2021_3069942 crossref_primary_10_1287_trsc_1110_0399 crossref_primary_10_1155_2020_2189275 crossref_primary_10_3141_2008_06 crossref_primary_10_1016_j_compag_2015_12_021 crossref_primary_10_1016_j_sbspro_2011_08_040 crossref_primary_10_1287_trsc_2017_0765 crossref_primary_10_1016_j_ejor_2009_05_005 crossref_primary_10_1016_j_cor_2020_105141 crossref_primary_10_4995_wpom_v2i1_804 crossref_primary_10_1016_j_cor_2009_12_002 crossref_primary_10_1016_j_amc_2012_08_092 crossref_primary_10_1016_j_biosystemseng_2015_04_004 crossref_primary_10_1016_j_ejor_2009_08_017 crossref_primary_10_1057_jors_2009_59 crossref_primary_10_7232_iems_2013_12_2_161 crossref_primary_10_1016_j_ins_2017_04_001 crossref_primary_10_1016_j_swevo_2020_100767 crossref_primary_10_1016_j_ejor_2014_01_005 crossref_primary_10_1016_j_ejor_2024_05_041 crossref_primary_10_1155_2013_809135 crossref_primary_10_1016_j_ejor_2014_02_018 crossref_primary_10_1007_s10732_014_9251_4 crossref_primary_10_1109_TTE_2023_3294588 crossref_primary_10_1016_j_asej_2021_02_028 crossref_primary_10_3390_logistics2030015 crossref_primary_10_3390_su13031573 crossref_primary_10_4028_www_scientific_net_AMR_684_621 crossref_primary_10_1057_jors_2011_51 crossref_primary_10_1016_j_ejor_2013_04_026 crossref_primary_10_1007_s10479_016_2233_1 crossref_primary_10_1109_TEVC_2013_2283916 crossref_primary_10_1155_2012_182584 crossref_primary_10_1002_mcda_1516 crossref_primary_10_1155_2013_509160 crossref_primary_10_1016_j_asoc_2015_07_001 crossref_primary_10_29121_granthaalayah_v5_i11_2017_2358 crossref_primary_10_1155_2022_3017196 crossref_primary_10_1287_opre_1120_1153 crossref_primary_10_3390_agriengineering1010006 crossref_primary_10_1007_s00291_007_0100_9 crossref_primary_10_1016_j_ejor_2020_07_005 crossref_primary_10_1109_TSMCC_2011_2148712 |
| Cites_doi | 10.1287/ijoc.8.2.165 10.1287/trsc.31.2.170 10.1016/S0377-2217(98)00107-6 10.1016/S0305-0548(01)00038-7 10.1287/ijoc.14.2.132.118 10.1016/S0377-2217(01)00237-5 10.1023/A:1009808327381 10.1016/S0377-2217(02)00147-9 10.1016/S0954-1810(01)00005-X 10.1287/opre.48.5.801.12407 10.1287/ijoc.11.2.161 10.1016/S0377-2217(01)00184-9 10.1287/trsc.33.1.101 10.1287/ijoc.8.2.158 10.1287/trsc.35.4.425.10431 10.1016/S0377-2217(96)00048-3 10.1016/S0377-2217(98)00315-4 10.1109/4235.797969 10.1145/508791.508900 10.1023/A:1024427114516 10.1287/opre.35.2.254 10.1109/3468.650319 10.1287/trsc.34.1.99.12278 10.1007/BFb0029752 10.1016/S0305-0548(98)00100-2 10.1016/0377-2217(94)00064-J 10.1016/S0927-0507(05)80105-7 10.1023/A:1011301019184 10.1016/0377-2217(95)00175-1 10.1016/S0377-2217(01)00201-6 10.1016/S0377-2217(02)00334-X 10.1016/S0305-0548(99)00101-X 10.1007/BF03325101 10.1057/palgrave.jors.2601163 10.1109/TEVC.2003.810759 10.1057/palgrave.jors.2601113 10.1287/trsc.33.4.381 10.1016/S0377-2217(01)00150-3 10.1016/S0377-2217(99)00259-3 10.1162/106365600568167 10.1023/A:1009661600931 10.1287/mnsc.44.10.1447 10.1016/0377-2217(95)00185-9 10.1109/4235.974840 10.1016/S0377-2217(99)00266-0 10.1007/BF02601637 10.1016/S0377-2217(99)00170-8 10.1016/S0377-2217(97)00010-6 10.1016/0305-0548(93)E0024-N 10.1109/TEVC.2003.810752 10.1016/S0377-2217(01)00363-0 10.1016/S0377-2217(99)00073-9 10.1016/0377-2217(94)00099-X 10.1016/S0377-2217(98)00260-4 10.1287/trsc.33.3.315 10.1287/opre.50.3.415.7751 10.1109/4235.752921 10.1016/S0305-0548(99)00073-8 10.1016/0305-0548(93)E0016-M 10.1016/S0377-2217(97)00172-0 10.1109/4235.585893 10.1109/4235.985691 10.1287/mnsc.6.1.80 10.1016/0377-2217(95)00016-J 10.1287/ijoc.15.4.347.24896 10.1287/trsc.36.2.250.565 10.1109/TSMCA.2002.806498 10.1016/S0377-2217(99)00045-4 10.1016/S0377-2217(98)00086-1 10.1016/S0004-3702(02)00371-5 10.1016/S0927-0507(05)80106-9 10.1016/0377-2217(95)00234-0 10.1287/opre.40.2.342 10.1016/0360-8352(96)00042-3 10.1109/ICSMC.2000.886611 10.1016/S0377-2217(96)00253-6 10.1287/trsc.37.1.69.12820 10.1162/106365600568158 10.1016/S0305-0548(00)00056-3 10.1016/0360-8352(96)00053-8 10.1201/9781420050073.ch11 10.1016/0377-2217(95)00191-3 |
| ContentType | Journal Article |
| Copyright | 2005 Elsevier B.V. 2006 INIST-CNRS Copyright Elsevier Sequoia S.A. Aug 1, 2006 |
| Copyright_xml | – notice: 2005 Elsevier B.V. – notice: 2006 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Aug 1, 2006 |
| DBID | AAYXX CITATION IQODW DKI X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D ADTOC UNPAY |
| DOI | 10.1016/j.ejor.2004.11.019 |
| DatabaseName | CrossRef Pascal-Francis RePEc IDEAS RePEc Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database |
| Database_xml | – sequence: 1 dbid: DKI name: RePEc IDEAS url: http://ideas.repec.org/ sourceTypes: Index Database – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business Applied Sciences |
| EISSN | 1872-6860 |
| EndPage | 885 |
| ExternalDocumentID | oai:scholarbank.nus.edu.sg:10635/54276 1016038721 eeeejores_v_3a172_3ay_3a2006_3ai_3a3_3ap_3a855_885_htm 17652945 10_1016_j_ejor_2004_11_019 S0377221705000056 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D ADTOC UNPAY |
| ID | FETCH-LOGICAL-c589t-a9f7365f13ea38a49062c572d83b62a67ef6d9d9cc53e2719a0aa1f3d60838873 |
| IEDL.DBID | UNPAY |
| ISSN | 0377-2217 1872-6860 |
| IngestDate | Tue Aug 26 13:43:44 EDT 2025 Fri Jul 25 07:04:57 EDT 2025 Wed Aug 18 03:50:57 EDT 2021 Mon Jul 21 09:12:42 EDT 2025 Wed Oct 01 00:55:28 EDT 2025 Thu Apr 24 23:16:09 EDT 2025 Fri Feb 23 02:32:19 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Vehicle routing Multi-objective optimization Evolutionary algorithms Local search Pareto optimum Decision support system Decision making Evolutionary algorithm Vehicle routing problem Multiobjective programming Combinatorial optimization Optimization Container Transportation problem Time window Minimal distance Logistics |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c589t-a9f7365f13ea38a49062c572d83b62a67ef6d9d9cc53e2719a0aa1f3d60838873 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=http://scholarbank.nus.edu.sg/handle/10635/54276 |
| PQID | 204278564 |
| PQPubID | 45678 |
| PageCount | 31 |
| ParticipantIDs | unpaywall_primary_10_1016_j_ejor_2004_11_019 proquest_journals_204278564 repec_primary_eeeejores_v_3a172_3ay_3a2006_3ai_3a3_3ap_3a855_885_htm pascalfrancis_primary_17652945 crossref_primary_10_1016_j_ejor_2004_11_019 crossref_citationtrail_10_1016_j_ejor_2004_11_019 elsevier_sciencedirect_doi_10_1016_j_ejor_2004_11_019 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2006-08-01 |
| PublicationDateYYYYMMDD | 2006-08-01 |
| PublicationDate_xml | – month: 08 year: 2006 text: 2006-08-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationSeriesTitle | European Journal of Operational Research |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2006 |
| Publisher | Elsevier B.V Elsevier Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier – name: Elsevier Sequoia S.A |
| References | Solomon (bib102) 1987; 35 Jaszkiewicz, A., 1998. Genetic local search for multiple objective combinatorial optimization. Institute of Computing Science, Poznań University of Technology, Research Report RA-014/98. Rego (bib95) 1998; 44 Fölsz, Mészáros, Rapcsák (bib44) 1995; 87 Malmborg (bib81) 1996; 93 Yang, Mathur, Ballou (bib117) 2000; 34 Crainic, Laporte (bib32) 1998 Rego, Roucairol (bib96) 1995; 83 Shaw (bib101) 1998 Potvin, Kervahut, Garcia, Rousseau (bib92) 1996; 8 Chavalitwongse, Kim, Pardalos (bib25) 2003; 7 Dror (bib41) 2000 Gezdur, A., Türkay, M., 2002. MILP solution to the vehicle routing problem with time windows and discrete vehicle capacities. In: XXIII National Operations Research and Industrial Engineering Congress, Istanbul, Turkey, July 2002. Swihart, Papastavrou (bib103) 1999; 114 Coello Coello (bib28) 1999; 1 Tan, Lee, Zhu, Ou (bib105) 2001; 15 Whitley, D., Starkweather, T., Fuquay, D., 1989. Scheduling problems and traveling salesmen: The genetic edge recombination operator. In: Third International Conference on Genetic Algorithms, San Mateo, CA. pp. 133–140. Caseau, Laburthe (bib23) 1999; 5 Golden, Assad (bib58) 1988 Thangiah, S.R., Osman, I.H., Sun, T., 1994. Hybrid genetic algorithm, simulated annealing and Tabu search methods for vehicle routing problems with time windows. Computer Science Department, Slippery Rock University, Technical Report SRU CpSc-TR-94-27. Cordone, Wolfler-Calvo (bib31) 2001; 7 Ghiani, Improta (bib55) 2000; 122 Ben, Rankin, Cumming, Fogarty (bib10) 1998 Baita, Pesenti, Ukovich, Favaretoo (bib5) 2000; 27 Breedam (bib20) 2001; 28 Maritime and Port Authority of Singapore, 2002. Singapore Maritime Portal, [Online]. Available from Dullaert, W., 2000. Impact of relative route length on the choice of time insertion criteria for insertion heuristics for the vehicle routing problem with time windows. In: Maurizio, B. (Ed.), The Rome Jubilee 2000 Conference Improving Knowledge and Tools for Transportation and Logistics Development: 8th Meeting of the Euro Working Group Transportation. pp. 153–156. Zitzler, Thiele (bib118) 1999; 3 Ribeiro, Hansen (bib99) 2002 Refanidis, Vlahavas (bib94) 2003; 145 Reimann, Doerner (bib97) 2002 Bagchi (bib4) 1999 Burke, Newall (bib22) 1999; 3 Potvin, Bengio (bib91) 1996; 8 Ishibashi, H., Aguirre, H., Tanaka, K., Sugimura, T., 2000. Multi-objective optimization with improved genetic algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC2000), Nashville. pp. 3852–3857. Bent, R., Van Hentenryck, P., 2001. A two-stage hybrid local search for the vehicle routing problem with time windows. Computer Science Department, Brown University, RI, Technical Report CS-01-06, September 2001. Breedam (bib19) 2002; 137 Jozefowiez, Semet, Talbi (bib69) 2002 Grefenstette, J.J., Gopal, R., Rosmaita, B., Van Gucht, D., 1985. Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications. pp. 160–168. Ioannou, Kritikos, Prastacos (bib63) 2001; 52 Muyldermans, Cattrysse, Oudheusden, Lotan (bib87) 2002; 139 Chao (bib24) 2002; 29 Beullens, Muyldermans, Cattrysse, Van Oudheusden (bib13) 2003; 147 Berger, J., Barkaoui, M., Bräysy, O., 2001. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Defense Research Establishment Valcartier, Canada, Working Paper. Deb (bib35) 2001 Tan, Lee, Khor (bib107) 2001; 5 Jaszkiewicz, A., 2001. Multiple objective metaheuristic algorithms for combinatorial optimization. Poznań University of Technology, Poznan, Habilitation Thesis 360. Taillard, Badeau, Gendreau, Guertin, Potvin (bib104) 1997; 31 Dorndorf, Pesch (bib40) 1995; 22 Desrosier, Dumas, Solomon, Soumis (bib37) 1995 Wolpert, Macready (bib115) 1996; 1 Bräysy, O., Gendreau, M., 2001a. Genetic algorithms for the vehicle routing problem with time windows. SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway, Internal Report STF42 A01021. Fonseca, Fleming (bib47) 1998; 1 Beasley, Christofides (bib8) 1997; 98 Glaab (bib56) 2002; 139 Goldberg, Lingle (bib57) 1985 Toth, Vigo (bib111) 2002 Gehring, Homberger (bib49) 2001; 18 Boland, Clarke, Nemhauser (bib14) 2000; 123 Li, H., Lim, A., 2002. Local search with annealing-like restarts to solve the vehicle routing problem with time windows. In: ACM Symposium on Applied Computing (SAC 2002). pp. 560–565. Kelly, Xu (bib71) 1999; 11 Gendreau, Laporte, Musaraganyi, Taillard (bib51) 1999; 26 Coello Coello, Van Veldhuizen, Lamont (bib29) 2002 Dillmann, Becker, Beckefeld (bib38) 1996; 90 Murata, Ishibuchi (bib86) 1996; 30 Doerner, Gronalt, Hartl, Reimann, Zisser (bib39) 2002 Min, Jayaraman, Srivastava (bib83) 1998; 108 Desrochers, Desrosiers, Solomon (bib36) 1992; 40 Van Veldhuizen, Lamont (bib113) 2000; 8 Chiang, Russel (bib27) 1996; 63 Salhi, Sari (bib100) 1997; 103 Belenguer, Martinez, Mota (bib9) 2000; 48 Fonseca, C.M., 1995. Multiobjective Genetic Algorithms with Application to Control Engineering Problems. Ph.D. Thesis. Department of Automatic Control and Systems Engineering. University of Sheffield, Sheffield, UK. Bräysy (bib16) 2003; 15 Bräysy, O., Gendreau, M., 2001b. Tabu search heuristics for the vehicle routing problem with time windows. SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway, Internal Report STF42 A01022. Fisher (bib43) 1995 Kohl, Desrosiers, Madsen, Solomon, Soumis (bib75) 1999; 33 Wu, Low, Bai (bib116) 2002; 29 Fonseca, Fleming (bib46) 1993 Karkazis, Boffey (bib70) 1995; 86 Breedam (bib21) 1995; 86 Cvetkovic, Parmee (bib33) 2002; 6 Bäck (bib3) 1996 Ishibuchi, Yoshida, Murata (bib65) 2003; 7 Lee, Tan, Ou, Chew (bib78) 2003; 33 Pretolani (bib93) 2000; 123 Brandão, Mercer (bib15) 1997; 100 Kenyon, Morton (bib72) 2003; 37 Toth, Vigo (bib110) 1999; 113 Tuzun, Burke (bib112) 1999; 116 Gambardella, Taillard, Agazzi (bib48) 1999 Knowles, Corne (bib74) 2000; 8 Liu, Shen (bib80) 1999; 118 Renaud, Boctor (bib98) 2002; 140 Baptista, Oliveira, Zúquete (bib6) 2002; 139 Bard, Kontoravdis, Yu (bib7) 2002; 36 Mourão, Almeida (bib85) 2000; 121 Poon, Carter (bib90) 1995; 22 Dantzig, Ramser (bib34) 1959; 6 Applegate, Cook, Dash, Rohe (bib2) 2002; 14 Cordeau, Laporte, Mercier (bib30) 2001; 52 Jaszkiewicz (bib68) 2003; 7 November 2002. Hertz, Mittaz (bib60) 2001; 35 Oliver, Smith, Holland (bib88) 1987 Laporte, Louveaux, Hamme (bib77) 2002; 50 Gerdeseen (bib50) 1996; 93 Tan, Lee, Ou (bib106) 2001; 18 Homberger, Gehring (bib61) 1999; 37 Thangiah, S.R., 1995. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. In: Proceedings of the Sixth International Conference on Genetics Algorithm, vol. 1, pp. 452–459. Mingozzi, Giorgi, Baldacci (bib84) 1999; 33 Chen, Neppalli, Aljabel (bib26) 1996; 30 Amberg, Domschke, Voß (bib1) 2000; 124 Paquete, L.F., Fonseca, C.M., 2001. A study of examination timetabling with multiobjective evolutionary algorithms. In: Metaheuristics International Conference, Porto, Portugal. Gendreau, Guertin, Potvin, Taillard (bib53) 1999; 33 Ichoua, Gendreau, Potvin (bib62) 2003; 144 Kilby, Prosser, Shaw (bib73) 2000; 5 Gendreau, M., Laporte, G., Potvin, J.Y., 1999b. Metaheuristics for the vehicle routing problem. University of Montreal, Canada, Les Cahiers du GERAD G-98-52. Kursawe, F., 1991. A variant of evolution strategies for vector optimization. In: Parallel Problem Solving from Nature. Lecture notes in Computer Science No. 496. pp. 193–197. Gehring (10.1016/j.ejor.2004.11.019_bib49) 2001; 18 Gerdeseen (10.1016/j.ejor.2004.11.019_bib50) 1996; 93 Coello Coello (10.1016/j.ejor.2004.11.019_bib29) 2002 Boland (10.1016/j.ejor.2004.11.019_bib14) 2000; 123 Mourão (10.1016/j.ejor.2004.11.019_bib85) 2000; 121 Potvin (10.1016/j.ejor.2004.11.019_bib91) 1996; 8 Belenguer (10.1016/j.ejor.2004.11.019_bib9) 2000; 48 Wolpert (10.1016/j.ejor.2004.11.019_bib115) 1996; 1 Bräysy (10.1016/j.ejor.2004.11.019_bib16) 2003; 15 Cvetkovic (10.1016/j.ejor.2004.11.019_bib33) 2002; 6 Bard (10.1016/j.ejor.2004.11.019_bib7) 2002; 36 Laporte (10.1016/j.ejor.2004.11.019_bib77) 2002; 50 Tuzun (10.1016/j.ejor.2004.11.019_bib112) 1999; 116 Kohl (10.1016/j.ejor.2004.11.019_bib75) 1999; 33 Dantzig (10.1016/j.ejor.2004.11.019_bib34) 1959; 6 10.1016/j.ejor.2004.11.019_bib11 Fonseca (10.1016/j.ejor.2004.11.019_bib46) 1993 10.1016/j.ejor.2004.11.019_bib12 Malmborg (10.1016/j.ejor.2004.11.019_bib81) 1996; 93 Breedam (10.1016/j.ejor.2004.11.019_bib20) 2001; 28 Burke (10.1016/j.ejor.2004.11.019_bib22) 1999; 3 Karkazis (10.1016/j.ejor.2004.11.019_bib70) 1995; 86 Beasley (10.1016/j.ejor.2004.11.019_bib8) 1997; 98 Applegate (10.1016/j.ejor.2004.11.019_bib2) 2002; 14 Doerner (10.1016/j.ejor.2004.11.019_bib39) 2002 Potvin (10.1016/j.ejor.2004.11.019_bib92) 1996; 8 Taillard (10.1016/j.ejor.2004.11.019_bib104) 1997; 31 Gendreau (10.1016/j.ejor.2004.11.019_bib51) 1999; 26 10.1016/j.ejor.2004.11.019_bib17 10.1016/j.ejor.2004.11.019_bib18 Pretolani (10.1016/j.ejor.2004.11.019_bib93) 2000; 123 Dorndorf (10.1016/j.ejor.2004.11.019_bib40) 1995; 22 10.1016/j.ejor.2004.11.019_bib42 10.1016/j.ejor.2004.11.019_bib45 Ichoua (10.1016/j.ejor.2004.11.019_bib62) 2003; 144 Baita (10.1016/j.ejor.2004.11.019_bib5) 2000; 27 Lee (10.1016/j.ejor.2004.11.019_bib78) 2003; 33 Golden (10.1016/j.ejor.2004.11.019_bib58) 1988 10.1016/j.ejor.2004.11.019_bib109 10.1016/j.ejor.2004.11.019_bib108 Toth (10.1016/j.ejor.2004.11.019_bib111) 2002 Salhi (10.1016/j.ejor.2004.11.019_bib100) 1997; 103 Refanidis (10.1016/j.ejor.2004.11.019_bib94) 2003; 145 Tan (10.1016/j.ejor.2004.11.019_bib105) 2001; 15 Gendreau (10.1016/j.ejor.2004.11.019_bib53) 1999; 33 Zitzler (10.1016/j.ejor.2004.11.019_bib118) 1999; 3 Toth (10.1016/j.ejor.2004.11.019_bib110) 1999; 113 Fonseca (10.1016/j.ejor.2004.11.019_bib47) 1998; 1 Ioannou (10.1016/j.ejor.2004.11.019_bib63) 2001; 52 Rego (10.1016/j.ejor.2004.11.019_bib95) 1998; 44 Dror (10.1016/j.ejor.2004.11.019_bib41) 2000 Ben (10.1016/j.ejor.2004.11.019_bib10) 1998 10.1016/j.ejor.2004.11.019_bib114 Ghiani (10.1016/j.ejor.2004.11.019_bib55) 2000; 122 Desrochers (10.1016/j.ejor.2004.11.019_bib36) 1992; 40 Chavalitwongse (10.1016/j.ejor.2004.11.019_bib25) 2003; 7 Jozefowiez (10.1016/j.ejor.2004.11.019_bib69) 2002 Shaw (10.1016/j.ejor.2004.11.019_bib101) 1998 Fölsz (10.1016/j.ejor.2004.11.019_bib44) 1995; 87 10.1016/j.ejor.2004.11.019_bib64 Cordeau (10.1016/j.ejor.2004.11.019_bib30) 2001; 52 10.1016/j.ejor.2004.11.019_bib66 Tan (10.1016/j.ejor.2004.11.019_bib106) 2001; 18 10.1016/j.ejor.2004.11.019_bib67 Bagchi (10.1016/j.ejor.2004.11.019_bib4) 1999 Knowles (10.1016/j.ejor.2004.11.019_bib74) 2000; 8 Dillmann (10.1016/j.ejor.2004.11.019_bib38) 1996; 90 Oliver (10.1016/j.ejor.2004.11.019_bib88) 1987 Mingozzi (10.1016/j.ejor.2004.11.019_bib84) 1999; 33 Chen (10.1016/j.ejor.2004.11.019_bib26) 1996; 30 Beullens (10.1016/j.ejor.2004.11.019_bib13) 2003; 147 Reimann (10.1016/j.ejor.2004.11.019_bib97) 2002 Desrosier (10.1016/j.ejor.2004.11.019_bib37) 1995 Tan (10.1016/j.ejor.2004.11.019_bib107) 2001; 5 Poon (10.1016/j.ejor.2004.11.019_bib90) 1995; 22 10.1016/j.ejor.2004.11.019_bib52 10.1016/j.ejor.2004.11.019_bib54 Wu (10.1016/j.ejor.2004.11.019_bib116) 2002; 29 Yang (10.1016/j.ejor.2004.11.019_bib117) 2000; 34 Crainic (10.1016/j.ejor.2004.11.019_bib32) 1998 Min (10.1016/j.ejor.2004.11.019_bib83) 1998; 108 Gambardella (10.1016/j.ejor.2004.11.019_bib48) 1999 Cordone (10.1016/j.ejor.2004.11.019_bib31) 2001; 7 10.1016/j.ejor.2004.11.019_bib59 Deb (10.1016/j.ejor.2004.11.019_bib35) 2001 Brandão (10.1016/j.ejor.2004.11.019_bib15) 1997; 100 10.1016/j.ejor.2004.11.019_bib89 Breedam (10.1016/j.ejor.2004.11.019_bib19) 2002; 137 Baptista (10.1016/j.ejor.2004.11.019_bib6) 2002; 139 Coello Coello (10.1016/j.ejor.2004.11.019_bib28) 1999; 1 Caseau (10.1016/j.ejor.2004.11.019_bib23) 1999; 5 Homberger (10.1016/j.ejor.2004.11.019_bib61) 1999; 37 10.1016/j.ejor.2004.11.019_bib82 Bäck (10.1016/j.ejor.2004.11.019_bib3) 1996 Goldberg (10.1016/j.ejor.2004.11.019_bib57) 1985 Hertz (10.1016/j.ejor.2004.11.019_bib60) 2001; 35 Kenyon (10.1016/j.ejor.2004.11.019_bib72) 2003; 37 Van Veldhuizen (10.1016/j.ejor.2004.11.019_bib113) 2000; 8 Jaszkiewicz (10.1016/j.ejor.2004.11.019_bib68) 2003; 7 Chiang (10.1016/j.ejor.2004.11.019_bib27) 1996; 63 10.1016/j.ejor.2004.11.019_bib76 Rego (10.1016/j.ejor.2004.11.019_bib96) 1995; 83 10.1016/j.ejor.2004.11.019_bib79 Solomon (10.1016/j.ejor.2004.11.019_bib102) 1987; 35 Murata (10.1016/j.ejor.2004.11.019_bib86) 1996; 30 Muyldermans (10.1016/j.ejor.2004.11.019_bib87) 2002; 139 Swihart (10.1016/j.ejor.2004.11.019_bib103) 1999; 114 Glaab (10.1016/j.ejor.2004.11.019_bib56) 2002; 139 Chao (10.1016/j.ejor.2004.11.019_bib24) 2002; 29 Kilby (10.1016/j.ejor.2004.11.019_bib73) 2000; 5 Ribeiro (10.1016/j.ejor.2004.11.019_bib99) 2002 Breedam (10.1016/j.ejor.2004.11.019_bib21) 1995; 86 Amberg (10.1016/j.ejor.2004.11.019_bib1) 2000; 124 Renaud (10.1016/j.ejor.2004.11.019_bib98) 2002; 140 Fisher (10.1016/j.ejor.2004.11.019_bib43) 1995 Ishibuchi (10.1016/j.ejor.2004.11.019_bib65) 2003; 7 Liu (10.1016/j.ejor.2004.11.019_bib80) 1999; 118 Kelly (10.1016/j.ejor.2004.11.019_bib71) 1999; 11 |
| References_xml | – volume: 140 start-page: 618 year: 2002 end-page: 628 ident: bib98 article-title: A sweep-based algorithm for the fleet size and mix vehicle routing problem publication-title: European Journal of Operational Research – volume: 123 start-page: 408 year: 2000 end-page: 427 ident: bib14 article-title: The asymmetric traveling salesman problem with replenishment arcs publication-title: European Journal of Operational Research – start-page: 271 year: 2002 end-page: 282 ident: bib69 article-title: Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem publication-title: Parallel Problem Solving from Nature – volume: 30 start-page: 1061 year: 1996 end-page: 1071 ident: bib86 article-title: Performance evaluation of genetic algorithms for flow shop scheduling problems publication-title: Computers and Industrial Engineering – volume: 18 start-page: 121 year: 2001 end-page: 130 ident: bib106 article-title: Hybrid genetic algorithms in solving vehicle routing problems with time window constraints publication-title: Asia-Pacific Journal of Operational Research – volume: 37 start-page: 69 year: 2003 end-page: 82 ident: bib72 article-title: Stochastic vehicle routing with random travel times publication-title: Transportation Science – volume: 113 start-page: 528 year: 1999 end-page: 543 ident: bib110 article-title: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls publication-title: European Journal of Operational Research – volume: 5 start-page: 281 year: 1999 end-page: 303 ident: bib23 article-title: Heuristics for large constrained vehicle routing problems publication-title: Journal of Heuristics – volume: 114 start-page: 447 year: 1999 end-page: 464 ident: bib103 article-title: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem publication-title: European Journal of Operational Research – volume: 34 start-page: 99 year: 2000 end-page: 112 ident: bib117 article-title: Stochastic vehicle routing problem with restocking publication-title: Transportation Science – reference: Thangiah, S.R., 1995. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. In: Proceedings of the Sixth International Conference on Genetics Algorithm, vol. 1, pp. 452–459. – volume: 33 start-page: 101 year: 1999 end-page: 116 ident: bib75 article-title: 2 path cuts for the vehicle routing problem with time windows publication-title: Transportation Science – volume: 37 start-page: 297 year: 1999 end-page: 318 ident: bib61 article-title: Two evolutionary metaheuristic for the vehicle routing problem with time windows publication-title: INFOR – volume: 8 start-page: 165 year: 1996 end-page: 172 ident: bib91 article-title: The vehicle routing problem with time windows—Part II: Genetic search publication-title: INFORMS Journal on Computing – volume: 44 start-page: 1447 year: 1998 end-page: 1459 ident: bib95 article-title: A subpath ejection method for the vehicle routing problem publication-title: Management Science – year: 2002 ident: bib29 article-title: Evolutionary Algorithms for Solving Multi-Objective Problems – year: 2002 ident: bib39 article-title: VRP with interdependent time windows—A case study for the Austrian Red Cross blood programme. in Operations Research Proceedings 2002 – reference: Grefenstette, J.J., Gopal, R., Rosmaita, B., Van Gucht, D., 1985. Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and Their Applications. pp. 160–168. – volume: 7 start-page: 107 year: 2001 end-page: 129 ident: bib31 article-title: A heuristic for the vehicle routing problem with time windows publication-title: Journal of Heuristics – volume: 27 start-page: 1249 year: 2000 end-page: 1269 ident: bib5 article-title: A comparison of different solution approaches to the vehicle scheduling problem in a practical case publication-title: Journal of Computer & Operations Research – volume: 35 start-page: 254 year: 1987 end-page: 265 ident: bib102 article-title: Algorithms for vehicle routing and scheduling problem with time window constraints publication-title: Operations Research – reference: Bräysy, O., Gendreau, M., 2001b. Tabu search heuristics for the vehicle routing problem with time windows. SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway, Internal Report STF42 A01022. – volume: 139 start-page: 521 year: 2002 end-page: 532 ident: bib87 article-title: Districting for salt spreading operations publication-title: European Journal of Operational Research – volume: 121 start-page: 420 year: 2000 end-page: 434 ident: bib85 article-title: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem publication-title: European Journal of Operational Research – year: 1998 ident: bib10 article-title: Timetabling the classes of an entire university with an evolutionary algorithm publication-title: Parallel Problem Solving from Nature V – volume: 52 start-page: 928 year: 2001 end-page: 936 ident: bib30 article-title: A unified tabu search heuristic for vehicle routing problems with time windows publication-title: Journal of the Operational Research Society – volume: 98 start-page: 499 year: 1997 end-page: 511 ident: bib8 article-title: Vehicle routing with a sparse feasibility graph publication-title: European Journal of Operational Research – volume: 100 start-page: 180 year: 1997 end-page: 191 ident: bib15 article-title: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem publication-title: European Journal of Operational Research – reference: Fonseca, C.M., 1995. Multiobjective Genetic Algorithms with Application to Control Engineering Problems. Ph.D. Thesis. Department of Automatic Control and Systems Engineering. University of Sheffield, Sheffield, UK. – reference: >. November 2002. – volume: 103 start-page: 95 year: 1997 end-page: 112 ident: bib100 article-title: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem publication-title: European Journal of Operational Research – year: 2002 ident: bib111 article-title: The Vehicle Routing Problem – start-page: 416 year: 1993 end-page: 423 ident: bib46 article-title: Genetic algorithm for multiobjective optimization, formulation, discussion and generalization publication-title: Genetic Algorithms: Proceedings of the Fifth International Conference – volume: 29 start-page: 33 year: 2002 end-page: 51 ident: bib24 article-title: A tabu search method for the truck and trailer routing problem publication-title: Computers and Operations Research – reference: Li, H., Lim, A., 2002. Local search with annealing-like restarts to solve the vehicle routing problem with time windows. In: ACM Symposium on Applied Computing (SAC 2002). pp. 560–565. – volume: 145 start-page: 1 year: 2003 end-page: 32 ident: bib94 article-title: Multiobjective heuristic state-space planning publication-title: Artificial Intelligence – reference: Kursawe, F., 1991. A variant of evolution strategies for vector optimization. In: Parallel Problem Solving from Nature. Lecture notes in Computer Science No. 496. pp. 193–197. – reference: Berger, J., Barkaoui, M., Bräysy, O., 2001. A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Defense Research Establishment Valcartier, Canada, Working Paper. – volume: 26 start-page: 1153 year: 1999 end-page: 1173 ident: bib51 article-title: A tabu search heuristic for heterogeneous fleet vehicle routing problem publication-title: Computers and Operations Research – volume: 18 start-page: 35 year: 2001 end-page: 47 ident: bib49 article-title: Parallel two phase metaheuristic for routing problems with time windows publication-title: Asia–Pacific Journal of Operation Research – volume: 90 start-page: 1 year: 1996 end-page: 12 ident: bib38 article-title: Practical aspects of route planning for magazine and newspaper wholesalers publication-title: European Journal of Operational Research – volume: 86 start-page: 480 year: 1995 end-page: 490 ident: bib21 article-title: Improvement heuristics for the vehicle routing problem based on simulated annealing publication-title: European Journal of Operational Research – volume: 36 start-page: 250 year: 2002 end-page: 269 ident: bib7 article-title: A branch and cut procedure for the vehicle routing problem with time windows publication-title: Transportation Science – volume: 22 start-page: 135 year: 1995 end-page: 147 ident: bib90 article-title: Genetic algorithm crossover operators for ordering applications publication-title: Journal of Computers and Operations Research – volume: 8 start-page: 149 year: 2000 end-page: 172 ident: bib74 article-title: Approximating the nondominated front using Pareto archived evolutionary strategy publication-title: Evolutionary Computation – year: 2001 ident: bib35 article-title: Multi-Objective Optimization using Evolutionary Algorithms – volume: 3 start-page: 257 year: 1999 end-page: 271 ident: bib118 article-title: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach publication-title: IEEE Transactions on Evolutionary Computation – reference: Maritime and Port Authority of Singapore, 2002. Singapore Maritime Portal, [Online]. Available from: < – volume: 1 start-page: 269 year: 1999 end-page: 308 ident: bib28 article-title: A comprehensive survey of evolutionary-based multiobjective optimization techniques publication-title: Knowledge and Information Systems – volume: 122 start-page: 11 year: 2000 end-page: 17 ident: bib55 article-title: An efficient transformation of the generalized vehicle routing problem publication-title: European Journal of Operational Research – volume: 137 start-page: 348 year: 2002 end-page: 370 ident: bib19 article-title: A parametric analysis of heuristics for the vehicle routing problem with side-constraints publication-title: European Journal of Operational Research – volume: 144 start-page: 379 year: 2003 end-page: 396 ident: bib62 article-title: Vehicle dispatching with time-dependent travel times publication-title: European Journal of Operational Research – volume: 118 start-page: 485 year: 1999 end-page: 504 ident: bib80 article-title: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows publication-title: European Journal of Operational Research – reference: Gendreau, M., Laporte, G., Potvin, J.Y., 1999b. Metaheuristics for the vehicle routing problem. University of Montreal, Canada, Les Cahiers du GERAD G-98-52. – volume: 8 start-page: 125 year: 2000 end-page: 147 ident: bib113 article-title: Multiobjective evolutionary algorithms: Analyzing the state-of-art publication-title: Evolutionary Computation – volume: 8 start-page: 158 year: 1996 end-page: 164 ident: bib92 article-title: The vehicle routing problem with time windows—Part I: Tabu search publication-title: INFORMS Journal on Computing – volume: 28 start-page: 289 year: 2001 end-page: 315 ident: bib20 article-title: Comparing descent heuristic and metaheuristic for the vehicle routing problem publication-title: Computer & Operations Research – start-page: 154 year: 1985 end-page: 159 ident: bib57 article-title: Alleles, loci and the traveling salesman problem publication-title: First International Conference on Genetic Algorithms – volume: 116 start-page: 87 year: 1999 end-page: 99 ident: bib112 article-title: A two-phase tabu search approach to the location routing problem publication-title: European Journal of Operational Research – year: 1996 ident: bib3 article-title: Evolutionary Algorithms in Theory and Practice – volume: 83 start-page: 411 year: 1995 end-page: 429 ident: bib96 article-title: Using tabu search for solving a dynamic multi-terminal truck dispatching problem publication-title: European Journal of Operational Research – volume: 35 start-page: 425 year: 2001 end-page: 434 ident: bib60 article-title: A variable neighbourhood descent algorithm for the undirected capacitated arc routing problem publication-title: Transportation Science – volume: 40 start-page: 342 year: 1992 end-page: 354 ident: bib36 article-title: A new optimization algorithm for the vehicle routing problem with time windows publication-title: Operational Research – reference: Bräysy, O., Gendreau, M., 2001a. Genetic algorithms for the vehicle routing problem with time windows. SINTEF Applied Mathematics, Department of Optimisation, Oslo, Norway, Internal Report STF42 A01021. – volume: 33 start-page: 169 year: 2003 end-page: 178 ident: bib78 article-title: Vehicle Capacity Planning System (VCPS): A case study on vehicle routing problem with time windows publication-title: IEEE Transactions on Systems, Man and Cybernetics: Part A (Systems and Humans) – volume: 147 start-page: 629 year: 2003 end-page: 643 ident: bib13 article-title: A guided local search heuristic for the capacitated arc routing problem publication-title: European Journal of Operational Research – start-page: 417 year: 1998 end-page: 431 ident: bib101 article-title: Using constraint programming and local search methods to solve vehicle routing problems publication-title: Principles and Practice of Constraint Programming—CP98 – volume: 48 start-page: 801 year: 2000 end-page: 810 ident: bib9 article-title: A lower bound for the split delivery vehicle routing problem publication-title: Operations Research – year: 2000 ident: bib41 article-title: Arc Routing: Theory, Solutions, and Applications – reference: Thangiah, S.R., Osman, I.H., Sun, T., 1994. Hybrid genetic algorithm, simulated annealing and Tabu search methods for vehicle routing problems with time windows. Computer Science Department, Slippery Rock University, Technical Report SRU CpSc-TR-94-27. – volume: 14 start-page: 132 year: 2002 end-page: 143 ident: bib2 article-title: Solution of a min–max vehicle routing problem publication-title: INFORMS Journal on Computing – volume: 7 start-page: 204 year: 2003 end-page: 223 ident: bib65 article-title: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling publication-title: IEEE Transactions on Evolutionary Computation – volume: 63 start-page: 3 year: 1996 end-page: 27 ident: bib27 article-title: Simulated annealing metaheuristic for the vehicle routing problem with time windows publication-title: Annals of Operations Research – start-page: 1 year: 1995 end-page: 33 ident: bib43 article-title: Vehicle routing publication-title: Handbooks in Operations Research and Management Science 8: Network Routing – reference: Gezdur, A., Türkay, M., 2002. MILP solution to the vehicle routing problem with time windows and discrete vehicle capacities. In: XXIII National Operations Research and Industrial Engineering Congress, Istanbul, Turkey, July 2002. – volume: 30 start-page: 919 year: 1996 end-page: 929 ident: bib26 article-title: Genetic algorithms applied to the continuous flowshop problem publication-title: Computers and Industrial Engineering – volume: 5 start-page: 389 year: 2000 end-page: 414 ident: bib73 article-title: A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints publication-title: Journal of Constraints – volume: 86 start-page: 201 year: 1995 end-page: 215 ident: bib70 article-title: Optimal location of routes for vehicles transporting hazardous materials publication-title: European Journal of Operational Research – year: 2002 ident: bib99 article-title: Essays and Surveys in Metaheuristics – volume: 15 start-page: 347 year: 2003 end-page: 368 ident: bib16 article-title: A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows publication-title: INFORMS Journal on Computing – volume: 139 start-page: 557 year: 2002 end-page: 577 ident: bib56 article-title: A new variant of a vehicle routing problem: Lower and upper bounds publication-title: European Journal of Operational Research – volume: 7 start-page: 179 year: 2003 end-page: 207 ident: bib25 article-title: GRASP with a new local search scheme for vehicle routing problems with time windows publication-title: Journal of Combinatorial Optimization – volume: 31 start-page: 170 year: 1997 end-page: 186 ident: bib104 article-title: A tabu search heuristic for the vehicle routing problem with soft time windows publication-title: Transportation Science – volume: 1 start-page: 67 year: 1996 end-page: 82 ident: bib115 article-title: No free lunch theorems for optimization publication-title: IEEE Transactions on Evolutionary Computation – volume: 52 start-page: 523 year: 2001 end-page: 537 ident: bib63 article-title: A greedy look ahead heuristic for the vehicle routing problem with time windows publication-title: Journal of the Operational Research Society – volume: 29 start-page: 1393 year: 2002 end-page: 1415 ident: bib116 article-title: Heuristic solutions to multi-depot location-routing problems publication-title: Computers and Operations Research – start-page: 224 year: 1987 end-page: 230 ident: bib88 article-title: A study of permutation crossover operators on the traveling salesman problem publication-title: Proceedings of the Second ICGA – volume: 33 start-page: 315 year: 1999 end-page: 329 ident: bib84 article-title: An exact method for the vehicle routing problem with backhauls publication-title: Transportation Science – volume: 5 start-page: 565 year: 2001 end-page: 588 ident: bib107 article-title: Evolutionary algorithm with dynamic population size and local exploration for multiobjective optimization publication-title: IEEE Transactions on Evolutionary Computation – reference: Bent, R., Van Hentenryck, P., 2001. A two-stage hybrid local search for the vehicle routing problem with time windows. Computer Science Department, Brown University, RI, Technical Report CS-01-06, September 2001. – volume: 93 start-page: 121 year: 1996 end-page: 134 ident: bib81 article-title: A genetic algorithm for service level based vehicle scheduling publication-title: European Journal of Operational Research – reference: Paquete, L.F., Fonseca, C.M., 2001. A study of examination timetabling with multiobjective evolutionary algorithms. In: Metaheuristics International Conference, Porto, Portugal. – reference: Jaszkiewicz, A., 1998. Genetic local search for multiple objective combinatorial optimization. Institute of Computing Science, Poznań University of Technology, Research Report RA-014/98. – volume: 6 start-page: 80 year: 1959 end-page: 91 ident: bib34 article-title: The truck dispatching problem publication-title: Management Science – volume: 87 start-page: 613 year: 1995 end-page: 623 ident: bib44 article-title: Distribution of gas cylinders publication-title: European Journal of Operational Research – start-page: 205 year: 2002 end-page: 210 ident: bib97 article-title: Savings based ants for large scale vehicle routing problems publication-title: Operations Research Proceedings 2002 – volume: 139 start-page: 220 year: 2002 end-page: 229 ident: bib6 article-title: A period vehicle routing case study publication-title: European Journal of Operational Research – year: 1999 ident: bib4 article-title: Multiobjective Scheduling by Genetic Algorithms – year: 1998 ident: bib32 article-title: Fleet Management and Logistics – year: 1999 ident: bib48 article-title: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows publication-title: New Ideas in Optimization – start-page: 35 year: 1995 end-page: 139 ident: bib37 article-title: Time constraint routing and scheduling publication-title: Handbooks in Operations Research and Management Science 8: Network Routing – volume: 3 start-page: 63 year: 1999 end-page: 74 ident: bib22 article-title: A multi-stage evolutionary algorithm for the timetable problem publication-title: IEEE Transactions on Evolutionary Computation – reference: Dullaert, W., 2000. Impact of relative route length on the choice of time insertion criteria for insertion heuristics for the vehicle routing problem with time windows. In: Maurizio, B. (Ed.), The Rome Jubilee 2000 Conference Improving Knowledge and Tools for Transportation and Logistics Development: 8th Meeting of the Euro Working Group Transportation. pp. 153–156. – volume: 11 start-page: 161 year: 1999 end-page: 172 ident: bib71 article-title: A set-partitioning-based heuristic for the vehicle routing problem publication-title: INFORMS Journal on Computing – volume: 50 start-page: 415 year: 2002 end-page: 423 ident: bib77 article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research – volume: 15 start-page: 281 year: 2001 end-page: 295 ident: bib105 article-title: Heuristic methods for vehicle routing problem with time windows publication-title: Artificial Intelligence in Engineering – reference: Whitley, D., Starkweather, T., Fuquay, D., 1989. Scheduling problems and traveling salesmen: The genetic edge recombination operator. In: Third International Conference on Genetic Algorithms, San Mateo, CA. pp. 133–140. – year: 1988 ident: bib58 article-title: Vehicle Routing: Methods and Studies – volume: 6 start-page: 42 year: 2002 end-page: 57 ident: bib33 article-title: Preferences and their application in evolutionary multiobjective optimization publication-title: IEEE Transactions on Evolutionary Computation – volume: 1 start-page: 26 year: 1998 end-page: 37 ident: bib47 article-title: Multiobjective optimization and multiple constraint handling with evolutionary algorithms—part I: A unified formulation publication-title: IEEE Transactions on Systems, Man and Cybernetics—Part A: Systems and Humans – volume: 93 start-page: 135 year: 1996 end-page: 137 ident: bib50 article-title: Vehicle routing problem with trailers publication-title: European Journal of Operational Research – volume: 108 start-page: 1 year: 1998 end-page: 15 ident: bib83 article-title: Combined location-routing problems: A synthesis and future research directions publication-title: European Journal of Operational Research – volume: 33 start-page: 381 year: 1999 end-page: 390 ident: bib53 article-title: Parallel tabu search for real-time vehicle routing and dispatching publication-title: Transportation Science – volume: 7 start-page: 133 year: 2003 end-page: 143 ident: bib68 article-title: Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem publication-title: IEEE Transactions on Evolutionary Computation – volume: 22 start-page: 25 year: 1995 end-page: 40 ident: bib40 article-title: Evaluation based learning in a jobshop scheduling environment publication-title: Computers and Operations Research – volume: 124 start-page: 360 year: 2000 end-page: 376 ident: bib1 article-title: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees publication-title: European Journal of Operational Research – reference: Ishibashi, H., Aguirre, H., Tanaka, K., Sugimura, T., 2000. Multi-objective optimization with improved genetic algorithm. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC2000), Nashville. pp. 3852–3857. – reference: Jaszkiewicz, A., 2001. Multiple objective metaheuristic algorithms for combinatorial optimization. Poznań University of Technology, Poznan, Habilitation Thesis 360. – volume: 123 start-page: 315 year: 2000 end-page: 324 ident: bib93 article-title: A directed hypergraph model for random time dependent shortest paths publication-title: European Journal of Operational Research – year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib35 – ident: 10.1016/j.ejor.2004.11.019_bib42 – volume: 8 start-page: 165 issue: 2 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib91 article-title: The vehicle routing problem with time windows—Part II: Genetic search publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.8.2.165 – volume: 31 start-page: 170 issue: 2 year: 1997 ident: 10.1016/j.ejor.2004.11.019_bib104 article-title: A tabu search heuristic for the vehicle routing problem with soft time windows publication-title: Transportation Science doi: 10.1287/trsc.31.2.170 – volume: 116 start-page: 87 issue: 1 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib112 article-title: A two-phase tabu search approach to the location routing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00107-6 – volume: 29 start-page: 1393 issue: 10 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib116 article-title: Heuristic solutions to multi-depot location-routing problems publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(01)00038-7 – volume: 14 start-page: 132 issue: 2 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib2 article-title: Solution of a min–max vehicle routing problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.14.2.132.118 – volume: 140 start-page: 618 issue: 3 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib98 article-title: A sweep-based algorithm for the fleet size and mix vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00237-5 – year: 1998 ident: 10.1016/j.ejor.2004.11.019_bib32 – volume: 5 start-page: 389 issue: 4 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib73 article-title: A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints publication-title: Journal of Constraints doi: 10.1023/A:1009808327381 – ident: 10.1016/j.ejor.2004.11.019_bib59 – volume: 144 start-page: 379 issue: 2 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib62 article-title: Vehicle dispatching with time-dependent travel times publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00147-9 – volume: 37 start-page: 297 issue: 1 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib61 article-title: Two evolutionary metaheuristic for the vehicle routing problem with time windows publication-title: INFOR – volume: 15 start-page: 281 issue: 3 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib105 article-title: Heuristic methods for vehicle routing problem with time windows publication-title: Artificial Intelligence in Engineering doi: 10.1016/S0954-1810(01)00005-X – volume: 48 start-page: 801 issue: 5 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib9 article-title: A lower bound for the split delivery vehicle routing problem publication-title: Operations Research doi: 10.1287/opre.48.5.801.12407 – start-page: 224 year: 1987 ident: 10.1016/j.ejor.2004.11.019_bib88 article-title: A study of permutation crossover operators on the traveling salesman problem – volume: 11 start-page: 161 issue: 2 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib71 article-title: A set-partitioning-based heuristic for the vehicle routing problem publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.11.2.161 – volume: 139 start-page: 521 issue: 3 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib87 article-title: Districting for salt spreading operations publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00184-9 – volume: 33 start-page: 101 issue: 1 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib75 article-title: 2 path cuts for the vehicle routing problem with time windows publication-title: Transportation Science doi: 10.1287/trsc.33.1.101 – volume: 8 start-page: 158 issue: 2 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib92 article-title: The vehicle routing problem with time windows—Part I: Tabu search publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.8.2.158 – year: 1998 ident: 10.1016/j.ejor.2004.11.019_bib10 article-title: Timetabling the classes of an entire university with an evolutionary algorithm – volume: 35 start-page: 425 issue: 4 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib60 article-title: A variable neighbourhood descent algorithm for the undirected capacitated arc routing problem publication-title: Transportation Science doi: 10.1287/trsc.35.4.425.10431 – volume: 98 start-page: 499 issue: 3 year: 1997 ident: 10.1016/j.ejor.2004.11.019_bib8 article-title: Vehicle routing with a sparse feasibility graph publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00048-3 – ident: 10.1016/j.ejor.2004.11.019_bib45 – volume: 18 start-page: 121 issue: 1 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib106 article-title: Hybrid genetic algorithms in solving vehicle routing problems with time window constraints publication-title: Asia-Pacific Journal of Operational Research – volume: 118 start-page: 485 issue: 3 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib80 article-title: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00315-4 – volume: 3 start-page: 257 issue: 4 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib118 article-title: Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.797969 – ident: 10.1016/j.ejor.2004.11.019_bib79 doi: 10.1145/508791.508900 – volume: 7 start-page: 179 issue: 2 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib25 article-title: GRASP with a new local search scheme for vehicle routing problems with time windows publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1024427114516 – volume: 35 start-page: 254 issue: 2 year: 1987 ident: 10.1016/j.ejor.2004.11.019_bib102 article-title: Algorithms for vehicle routing and scheduling problem with time window constraints publication-title: Operations Research doi: 10.1287/opre.35.2.254 – volume: 1 start-page: 26 issue: 28 year: 1998 ident: 10.1016/j.ejor.2004.11.019_bib47 article-title: Multiobjective optimization and multiple constraint handling with evolutionary algorithms—part I: A unified formulation publication-title: IEEE Transactions on Systems, Man and Cybernetics—Part A: Systems and Humans doi: 10.1109/3468.650319 – year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib39 – ident: 10.1016/j.ejor.2004.11.019_bib82 – volume: 34 start-page: 99 issue: 1 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib117 article-title: Stochastic vehicle routing problem with restocking publication-title: Transportation Science doi: 10.1287/trsc.34.1.99.12278 – ident: 10.1016/j.ejor.2004.11.019_bib76 doi: 10.1007/BFb0029752 – volume: 26 start-page: 1153 issue: 12 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib51 article-title: A tabu search heuristic for heterogeneous fleet vehicle routing problem publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(98)00100-2 – start-page: 154 year: 1985 ident: 10.1016/j.ejor.2004.11.019_bib57 article-title: Alleles, loci and the traveling salesman problem – volume: 86 start-page: 480 issue: 3 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib21 article-title: Improvement heuristics for the vehicle routing problem based on simulated annealing publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00064-J – start-page: 1 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib43 article-title: Vehicle routing doi: 10.1016/S0927-0507(05)80105-7 – year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib4 – volume: 7 start-page: 107 issue: 2 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib31 article-title: A heuristic for the vehicle routing problem with time windows publication-title: Journal of Heuristics doi: 10.1023/A:1011301019184 – ident: 10.1016/j.ejor.2004.11.019_bib54 – volume: 93 start-page: 135 issue: 1 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib50 article-title: Vehicle routing problem with trailers publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00175-1 – volume: 139 start-page: 557 issue: 3 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib56 article-title: A new variant of a vehicle routing problem: Lower and upper bounds publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00201-6 – volume: 147 start-page: 629 issue: 3 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib13 article-title: A guided local search heuristic for the capacitated arc routing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00334-X – volume: 28 start-page: 289 issue: 4 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib20 article-title: Comparing descent heuristic and metaheuristic for the vehicle routing problem publication-title: Computer & Operations Research doi: 10.1016/S0305-0548(99)00101-X – ident: 10.1016/j.ejor.2004.11.019_bib12 – volume: 1 start-page: 269 issue: 3 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib28 article-title: A comprehensive survey of evolutionary-based multiobjective optimization techniques publication-title: Knowledge and Information Systems doi: 10.1007/BF03325101 – volume: 52 start-page: 928 issue: 8 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib30 article-title: A unified tabu search heuristic for vehicle routing problems with time windows publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601163 – volume: 7 start-page: 133 issue: 2 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib68 article-title: Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810759 – start-page: 417 year: 1998 ident: 10.1016/j.ejor.2004.11.019_bib101 article-title: Using constraint programming and local search methods to solve vehicle routing problems – ident: 10.1016/j.ejor.2004.11.019_bib18 – ident: 10.1016/j.ejor.2004.11.019_bib114 – volume: 52 start-page: 523 issue: 5 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib63 article-title: A greedy look ahead heuristic for the vehicle routing problem with time windows publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601113 – volume: 33 start-page: 381 issue: 4 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib53 article-title: Parallel tabu search for real-time vehicle routing and dispatching publication-title: Transportation Science doi: 10.1287/trsc.33.4.381 – volume: 137 start-page: 348 issue: 2 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib19 article-title: A parametric analysis of heuristics for the vehicle routing problem with side-constraints publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00150-3 – volume: 123 start-page: 315 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib93 article-title: A directed hypergraph model for random time dependent shortest paths publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00259-3 – volume: 8 start-page: 149 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib74 article-title: Approximating the nondominated front using Pareto archived evolutionary strategy publication-title: Evolutionary Computation doi: 10.1162/106365600568167 – start-page: 271 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib69 article-title: Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem – volume: 5 start-page: 281 issue: 3 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib23 article-title: Heuristics for large constrained vehicle routing problems publication-title: Journal of Heuristics doi: 10.1023/A:1009661600931 – year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib99 – volume: 18 start-page: 35 issue: 1 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib49 article-title: Parallel two phase metaheuristic for routing problems with time windows publication-title: Asia–Pacific Journal of Operation Research – volume: 44 start-page: 1447 issue: 10 year: 1998 ident: 10.1016/j.ejor.2004.11.019_bib95 article-title: A subpath ejection method for the vehicle routing problem publication-title: Management Science doi: 10.1287/mnsc.44.10.1447 – volume: 93 start-page: 121 issue: 1 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib81 article-title: A genetic algorithm for service level based vehicle scheduling publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00185-9 – volume: 5 start-page: 565 issue: 6 year: 2001 ident: 10.1016/j.ejor.2004.11.019_bib107 article-title: Evolutionary algorithm with dynamic population size and local exploration for multiobjective optimization publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.974840 – volume: 123 start-page: 408 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib14 article-title: The asymmetric traveling salesman problem with replenishment arcs publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00266-0 – volume: 63 start-page: 3 issue: 1 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib27 article-title: Simulated annealing metaheuristic for the vehicle routing problem with time windows publication-title: Annals of Operations Research doi: 10.1007/BF02601637 – volume: 124 start-page: 360 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib1 article-title: Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00170-8 – ident: 10.1016/j.ejor.2004.11.019_bib17 – volume: 100 start-page: 180 issue: 1 year: 1997 ident: 10.1016/j.ejor.2004.11.019_bib15 article-title: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)00010-6 – ident: 10.1016/j.ejor.2004.11.019_bib109 – volume: 22 start-page: 135 issue: 1 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib90 article-title: Genetic algorithm crossover operators for ordering applications publication-title: Journal of Computers and Operations Research doi: 10.1016/0305-0548(93)E0024-N – volume: 7 start-page: 204 issue: 2 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib65 article-title: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/TEVC.2003.810752 – year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib48 article-title: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows – start-page: 416 year: 1993 ident: 10.1016/j.ejor.2004.11.019_bib46 article-title: Genetic algorithm for multiobjective optimization, formulation, discussion and generalization – ident: 10.1016/j.ejor.2004.11.019_bib52 – volume: 139 start-page: 220 issue: 2 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib6 article-title: A period vehicle routing case study publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(01)00363-0 – volume: 122 start-page: 11 issue: 1 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib55 article-title: An efficient transformation of the generalized vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00073-9 – volume: 86 start-page: 201 issue: 2 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib70 article-title: Optimal location of routes for vehicles transporting hazardous materials publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00099-X – ident: 10.1016/j.ejor.2004.11.019_bib89 – volume: 114 start-page: 447 issue: 3 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib103 article-title: A stochastic and dynamic model for the single-vehicle pick-up and delivery problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00260-4 – ident: 10.1016/j.ejor.2004.11.019_bib66 – volume: 33 start-page: 315 issue: 3 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib84 article-title: An exact method for the vehicle routing problem with backhauls publication-title: Transportation Science doi: 10.1287/trsc.33.3.315 – volume: 50 start-page: 415 issue: 3 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib77 article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands publication-title: Operations Research doi: 10.1287/opre.50.3.415.7751 – volume: 3 start-page: 63 issue: 1 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib22 article-title: A multi-stage evolutionary algorithm for the timetable problem publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.752921 – volume: 27 start-page: 1249 issue: 3 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib5 article-title: A comparison of different solution approaches to the vehicle scheduling problem in a practical case publication-title: Journal of Computer & Operations Research doi: 10.1016/S0305-0548(99)00073-8 – volume: 22 start-page: 25 issue: 1 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib40 article-title: Evaluation based learning in a jobshop scheduling environment publication-title: Computers and Operations Research doi: 10.1016/0305-0548(93)E0016-M – volume: 108 start-page: 1 issue: 1 year: 1998 ident: 10.1016/j.ejor.2004.11.019_bib83 article-title: Combined location-routing problems: A synthesis and future research directions publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)00172-0 – volume: 1 start-page: 67 issue: 1 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib115 article-title: No free lunch theorems for optimization publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.585893 – volume: 6 start-page: 42 issue: 1 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib33 article-title: Preferences and their application in evolutionary multiobjective optimization publication-title: IEEE Transactions on Evolutionary Computation doi: 10.1109/4235.985691 – volume: 6 start-page: 80 year: 1959 ident: 10.1016/j.ejor.2004.11.019_bib34 article-title: The truck dispatching problem publication-title: Management Science doi: 10.1287/mnsc.6.1.80 – volume: 83 start-page: 411 issue: 2 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib96 article-title: Using tabu search for solving a dynamic multi-terminal truck dispatching problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00016-J – volume: 15 start-page: 347 issue: 4 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib16 article-title: A reactive variable neighborhood search algorithm for the vehicle routing problem with time windows publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.15.4.347.24896 – volume: 36 start-page: 250 issue: 2 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib7 article-title: A branch and cut procedure for the vehicle routing problem with time windows publication-title: Transportation Science doi: 10.1287/trsc.36.2.250.565 – volume: 33 start-page: 169 issue: 2 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib78 article-title: Vehicle Capacity Planning System (VCPS): A case study on vehicle routing problem with time windows publication-title: IEEE Transactions on Systems, Man and Cybernetics: Part A (Systems and Humans) doi: 10.1109/TSMCA.2002.806498 – volume: 121 start-page: 420 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib85 article-title: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00045-4 – start-page: 205 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib97 article-title: Savings based ants for large scale vehicle routing problems – volume: 113 start-page: 528 issue: 3 year: 1999 ident: 10.1016/j.ejor.2004.11.019_bib110 article-title: A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(98)00086-1 – year: 1988 ident: 10.1016/j.ejor.2004.11.019_bib58 – ident: 10.1016/j.ejor.2004.11.019_bib67 – volume: 145 start-page: 1 issue: 1 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib94 article-title: Multiobjective heuristic state-space planning publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(02)00371-5 – start-page: 35 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib37 article-title: Time constraint routing and scheduling doi: 10.1016/S0927-0507(05)80106-9 – volume: 87 start-page: 613 issue: 3 year: 1995 ident: 10.1016/j.ejor.2004.11.019_bib44 article-title: Distribution of gas cylinders publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00234-0 – volume: 40 start-page: 342 issue: 2 year: 1992 ident: 10.1016/j.ejor.2004.11.019_bib36 article-title: A new optimization algorithm for the vehicle routing problem with time windows publication-title: Operational Research doi: 10.1287/opre.40.2.342 – year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib3 – volume: 30 start-page: 919 issue: 4 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib26 article-title: Genetic algorithms applied to the continuous flowshop problem publication-title: Computers and Industrial Engineering doi: 10.1016/0360-8352(96)00042-3 – year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib29 – ident: 10.1016/j.ejor.2004.11.019_bib64 doi: 10.1109/ICSMC.2000.886611 – volume: 103 start-page: 95 issue: 1 year: 1997 ident: 10.1016/j.ejor.2004.11.019_bib100 article-title: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00253-6 – volume: 37 start-page: 69 issue: 1 year: 2003 ident: 10.1016/j.ejor.2004.11.019_bib72 article-title: Stochastic vehicle routing with random travel times publication-title: Transportation Science doi: 10.1287/trsc.37.1.69.12820 – volume: 8 start-page: 125 issue: 2 year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib113 article-title: Multiobjective evolutionary algorithms: Analyzing the state-of-art publication-title: Evolutionary Computation doi: 10.1162/106365600568158 – volume: 29 start-page: 33 issue: 1 year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib24 article-title: A tabu search method for the truck and trailer routing problem publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(00)00056-3 – volume: 30 start-page: 1061 issue: 4 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib86 article-title: Performance evaluation of genetic algorithms for flow shop scheduling problems publication-title: Computers and Industrial Engineering doi: 10.1016/0360-8352(96)00053-8 – ident: 10.1016/j.ejor.2004.11.019_bib108 doi: 10.1201/9781420050073.ch11 – year: 2002 ident: 10.1016/j.ejor.2004.11.019_bib111 – ident: 10.1016/j.ejor.2004.11.019_bib11 – volume: 90 start-page: 1 issue: 1 year: 1996 ident: 10.1016/j.ejor.2004.11.019_bib38 article-title: Practical aspects of route planning for magazine and newspaper wholesalers publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00191-3 – year: 2000 ident: 10.1016/j.ejor.2004.11.019_bib41 |
| SSID | ssj0001515 |
| Score | 2.249219 |
| Snippet | This paper considers a transportation problem for moving empty or laden containers for a logistic company. Owing to the limited resource of its vehicles... |
| SourceID | unpaywall proquest repec pascalfrancis crossref elsevier |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 855 |
| SubjectTerms | Algorithms Applied sciences Decision theory. Utility theory Evolutionary algorithms Exact sciences and technology Flows in networks. Combinatorial problems Genetic algorithms Heuristic Job orders Logistics Multi-objective optimization Operational research and scientific management Operational research. Management science Operations research Optimization Route optimization Studies Transportation problem (Operations research) Trucks Vehicle routing Vehicles |
| SummonAdditionalLinks | – databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] dbid: AIKHN link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-NVoJNiI_CRBhMfuANQps4dpLHajAVEHuBSXuznNihLV0StV1R_3vuEqesEpoQkZxIURx_Xe5-ds6_A3jDrZU2DgwFNEn9KLe5r40o_MwIQhf5KM9ovePrhZxcRp-vxNUBnHV7Ycit0un-Vqc32trdGbreHNaz2fDbiCMyDIkOhpSukPegj_YnSXrQH3_6MrnYKWSy2c3PhDj2KYPbO9O6edl51dCCRu-JzJMId_5unx7WeoW9VrThLvbwaH9pa5sfwYObstbbX3qxuGWizp_AI4ct2bit_lM4sOUA7neu7QN43IVwYO6LHsDRLT7CZ1CM2XRLW7hY42foV9m81YfMbpyI6uWW6cWPajlbT68ZIl6GwkuLEoyIaH8yXRpGYScWWMrGTqkibFndkHM1c8FrVs_h8vzj97OJ7wIx-LlI0rWv0yLmUhQBt5onOiJu41zEoUl4JkMtY1tIk5o0zwW3YRykeqR1UHAjEeChFuPH0Cur0r4AFqaxxgcQtWQcZ6JGG2tojmVDMyoiKz0Iuu5XuWMpb2qtOne0uaIho_CZEU5fFA6ZB293eeqWo-POp0U3qmpP0hQakTvzne6JwJ-iYinCNBIenHQyoZwiWOELKJaJkJEHHxox2WWzeGARdqU2imvEkXjeYqI1HrzMMHFMNaZECJUkQk3X1x6820nZPzT25X829gQO27Um8nR8BT0UIfsa0dc6O3Vf128sSy28 priority: 102 providerName: Elsevier |
| Title | A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems |
| URI | https://dx.doi.org/10.1016/j.ejor.2004.11.019 http://econpapers.repec.org/article/eeeejores/v_3a172_3ay_3a2006_3ai_3a3_3ap_3a855-885.htm https://www.proquest.com/docview/204278564 http://scholarbank.nus.edu.sg/handle/10635/54276 |
| UnpaywallVersion | submittedVersion |
| Volume | 172 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: ACRLP dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIKHN dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AKRWK dateStart: 19770101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1db9MwFL3aWgmYEIMORBlUfuAN0jVx7CSPFWPqmKhAotJ4shzbWdd2adWvqXvgt3OdOGUTaBqRnKiSHTvtiX3sXp8D8J4aw03ka2toknihMsqTmmVeqpllF6qjUrve8bXPe4Pwyzk734HKBNHN6FKZj9v5qlQSXFwclYoD-Ibj8HjEwiDiu1DnDNl3DeqD_rfuz-LPgijygqAw2fXjKPB4zDtun0wZ0mVG00ICNGxb4U4rrvPvsejpTC7wG8pKa4s73LM-NzOj9uDxKp_JzbWcTG4NRyf78L3a1FNGoYzbq2XaVjd_azw--EmfwzPHTUm3BNML2DF5Ax5VofEN2K8sIIjrERqwd0vP8ACyLhlu7BYwUsQpetN0VPanxKwdxOV8Q-TkYjq_XA6vCDJmguC3ixrECtmOCTaMWNuKCdayNkPbEDKfrmxwNnHmN4uXMDj5_ONTz3NGDp5icbL0ZJJFlLPMp0bSWIZWG1mxKNAxTXkgeWQyrhOdKMWoCSI_kR0p_YxqjgQRe0H6Cmr5NDevgQRJJDEDsp6U4kxWS220naOZQHey0PAm-NVPKpRTOS9aLapwtpGwMLD2myFOfwTCoAkftmVmpcbHvblZhRThWErJPgQOQveWa92B1Z-qIs6CJGRNOKxwJlxHssAbWC8UxsMmHBfQ2xYzeGAVZiHWgkrkoXjeYLJrRHi5xEQxzTDFjIk4ZmK4vGrCxy1yH_Cwb_4v-yE8KZeobIDkW6ghcsw7JG3LtAW77V9-C-rd07NeHz8dn5223Lv7G9L9QxU |
| linkProvider | Unpaywall |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwED-NTWJMiI_CtDIYfuANsjZx7CSP02AqsO2FTdqb5cTO2tIlUdsV9YW_nbvE6VYJTYhITqTIjr_O55-d8-8APnBrpY18Qw5NEi_MbOZpI3IvNYLQRdbPUtrvODuXg8vw25W42oDj9iwMmVU63d_o9Fpbuzc915q9ajTq_ehzRIYB0cGQ0hXyEWyFIohoBXb4-87Og2bs-ldCFHkU3Z2caYy87LisSUHDQ6LyJLqdv89OTys9wzbLG2cXa2h0a2orm-3A9m1R6eUvPZncm6BOXsAzhyzZUVP4l7Bhiw48bg3bO_C8deDA3HjuwM49NsJXkB-x4ZIOcLHaytAr03GjDZldOAHV0yXTk-tyOpoPbxjiXYaiS1sSjGhofzJdGEZOJyaYy8IOqSBsWt6SaTVzrmtmr-Hy5MvF8cBzbhi8TMTJ3NNJHnEpcp9bzWMdErNxJqLAxDyVgZaRzaVJTJJlgtsg8hPd19rPuZEI71CH8V3YLMrC7gELkkhjBMQsKcd1qNHGGlph2cD089DKLvht86vMcZTXpVatMdpYUZeR88wQFy8Ku6wLH1dpqoah48HYou1VtSZnCqeQB9MdrInAXVaRFEESii7stzKhnBqY4QfIk4mQYRc-12KySmbxwizsTC0U14gi8b7EQDs8-Bhh4BgqDLEQKo6FGs5vuvBpJWX_UNk3_1nZ97A9uDg7Vadfz7_vw5Nm14lsHt_CJoqTfYc4bJ4e1OPsD8uvL4I |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1db9MwFL0arQRMiEEBEQaTH3iDdE0c28ljBUwTEhNIVBpPlmM769oujfqFyq_nOnHKJtA0Ijl5sWu7PbGP3etzAN5Sa7kVkXGGJlmYaKtDZVgR5oY5dqEHOnf7HV_O-Oko-XzOzvegNUH0K7pcldN-uW6UBJcXx43iAL7hOD0esyQW_B50OUP23YHu6Ozr8Ef9Z4EQYRzXJrtRKuKQp3zgz8k0IV12Mq8lQJO-E-504jr_noseVWqJ31DRWFvc4J7dha2s3ocH67JS259qNrs2HZ0cwLf2UE8ThTLtr1d5X__6W-Pxzj19Ao89NyXDBkxPYc-WPbjfhsb34KC1gCB-ROjB_jU9w2dQDMl4646AkTpOMZznk2Y8JXbjIa4WW6JmF_PF5Wp8RZAxEwS_29QgTsh2SrBhxNlWzLCWjR27hpDFfO2Cs4k3v1k-h9HJp-8fTkNv5BBqlmarUGWFoJwVEbWKpipx2siaidikNOex4sIW3GQm05pRG4soUwOlooIajgQRR0H6AjrlvLQvgcSZUJgBWU9OcSVrlLHGrdFsbAZFYnkAUfuTSu1VzutWyzacbSIdDJz9ZoLLH4kwCODdrkzVaHzcmpu1SJGepTTsQ-IkdGu5oxuw-lOV4CzOEhbAYYsz6QeSJX6A80JhPAngYw29XTGLF1Zhl3IjqUIeivctJrdHhI9LTBRThSllTKYpk-PVVQDvd8i9Q2df_V_2Q3jYbFG5AMnX0EHk2DdI2lb5kX9PfwO_uj-Q |
| 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+hybrid+multi-objective+evolutionary+algorithm+for+solving+truck+and+trailer+vehicle+routing+problems&rft.jtitle=European+journal+of+operational+research&rft.au=Tan%2C+K.C.&rft.au=Chew%2C+Y.H.&rft.au=Lee%2C+L.H.&rft.date=2006-08-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=172&rft.issue=3&rft.spage=855&rft.epage=885&rft_id=info:doi/10.1016%2Fj.ejor.2004.11.019&rft.externalDocID=S0377221705000056 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |