메뉴 건너뛰기




Volumn 52, Issue PART A, 2014, Pages 39-54

A vehicle routing problem with flexible time windows

Author keywords

Flexible time windows; Soft time windows; Time windows; Vehicle routing problems

Indexed keywords

BENCHMARKING; LINEAR PROGRAMMING; SALES; TABU SEARCH; VEHICLES;

EID: 84905824207     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.07.005     Document Type: Article
Times cited : (75)

References (33)
  • 1
    • 0027558256 scopus 로고
    • Simple heuristics for the vehicle routeing problem with soft time windows
    • N. Balakrishnan Simple heuristics for the vehicle routeing problem with soft time windows J Oper Res Soc 44 1993 279 287
    • (1993) J Oper Res Soc , vol.44 , pp. 279-287
    • Balakrishnan, N.1
  • 2
    • 81455135706 scopus 로고    scopus 로고
    • New route relaxation and pricing strategies for the vehicle routing problem
    • R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Oper Res 59 2011 1269 1283
    • (2011) Oper Res , vol.59 , pp. 1269-1283
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 3
    • 83955162912 scopus 로고    scopus 로고
    • Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
    • R. Baldacci, A. Mingozzi, and R. Roberti Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints Eur J Oper Res 218 2012 1 6
    • (2012) Eur J Oper Res , vol.218 , pp. 1-6
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 4
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part I: Route construction and local search algorithms
    • DOI 10.1287/trsc.1030.0056
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, part I route construction and local search algorithms Transp Sci 39 2005 104 118 (Pubitemid 40466664)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 104-118
    • Braysy, O.1    Gendreau, M.2
  • 5
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part II: Metaheuristics
    • DOI 10.1287/trsc.1030.0057
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, part II metaheuristics Transp Sci 39 2005 119 139 (Pubitemid 40453880)
    • (2005) Transportation Science , vol.39 , Issue.1 , pp. 119-139
    • Braysy, O.1    Gendreau, M.2
  • 6
  • 7
    • 9744257014 scopus 로고    scopus 로고
    • A metaheuristic for the vehicle-routeing problem with soft time windows
    • W. Chiang, and R. Russell A metaheuristic for the vehicle-routeing problem with soft time windows J Oper Res Soc 55 2004 1298 1310
    • (2004) J Oper Res Soc , vol.55 , pp. 1298-1310
    • Chiang, W.1    Russell, R.2
  • 8
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • J. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 1997 105 119 (Pubitemid 127360996)
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.-F.1    Gendreau, M.2    Laporte, G.3
  • 10
    • 0035424778 scopus 로고    scopus 로고
    • A unified tabu search heuristic for vehicle routing problems with time windows
    • DOI 10.1057/palgrave/jors/2601163
    • J. Cordeau, G. Laporte, and A. Mercier A unified tabu search heuristic for vehicle routing problems with time windows J Oper Res Soc 52 2001 928 936 (Pubitemid 32720268)
    • (2001) Journal of the Operational Research Society , vol.52 , Issue.8 , pp. 928-936
    • Cordeau, J.-F.1    Laporte, G.2    Mercier, A.3
  • 11
    • 70449635850 scopus 로고    scopus 로고
    • Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows
    • G. Desaulniers, F. Lessard, and A. Hadjar Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transp Sci 42 2008 387 404
    • (2008) Transp Sci , vol.42 , pp. 387-404
    • Desaulniers, G.1    Lessard, F.2    Hadjar, A.3
  • 12
    • 0035897978 scopus 로고    scopus 로고
    • Ship scheduling with soft time windows: An optimisation based approach
    • DOI 10.1016/S0377-2217(00)00098-9, PII S0377221700000989
    • K. Fagerholt Ship scheduling with soft time windows an optimisation based approach Eur J Oper Res 131 2001 559 571 (Pubitemid 32272378)
    • (2001) European Journal of Operational Research , vol.131 , Issue.3 , pp. 559-571
    • Fagerholt, K.1
  • 13
    • 77953361445 scopus 로고    scopus 로고
    • An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows
    • M. Figliozzi An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows Transp Res Part C 18 2010 668 679
    • (2010) Transp Res Part C , vol.18 , pp. 668-679
    • Figliozzi, M.1
  • 14
    • 42649126395 scopus 로고    scopus 로고
    • A unified tabu search algorithm for vehicle routing problems with soft time windows
    • DOI 10.1057/palgrave.jors.2602371, PII 2602371
    • Z. Fu, R. Eglese, and L. Li A unified tabu search algorithm for vehicle routing problems with soft time windows J Oper Res Soc 59 2008 663 673 (Pubitemid 351598877)
    • (2008) Journal of the Operational Research Society , vol.59 , Issue.5 , pp. 663-673
    • Fu, Z.1    Eglese, R.2    Li, L.Y.O.3
  • 15
    • 0028533002 scopus 로고
    • A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints
    • B. Garcia, J. Potvin, and J. Rousseau A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints Comput Oper Res 21 1994 1025 1033
    • (1994) Comput Oper Res , vol.21 , pp. 1025-1033
    • Garcia, B.1    Potvin, J.2    Rousseau, J.3
  • 16
    • 0028530194 scopus 로고
    • A tabu search heuristic for the vehicle routing problem
    • M. Gendreau, A. Hertz, and G. Laporte A tabu search heuristic for the vehicle routing problem Manag Sci 40 1994 1276 1290
    • (1994) Manag Sci , vol.40 , pp. 1276-1290
    • Gendreau, M.1    Hertz, A.2    Laporte, G.3
  • 17
    • 0030134790 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
    • M. Gendreau, G. Laporte, and R. Séguin A tabu search heuristic for the vehicle routing problem with stochastic demands and customers Oper Res 44 1996 469 477 (Pubitemid 126669512)
    • (1996) Operations Research , vol.44 , Issue.3 , pp. 469-477
    • Gendreau, M.1    Laporte, G.2    Seguin, R.3
  • 19
    • 33747820517 scopus 로고    scopus 로고
    • The vehicle routing problem with flexible time windows and traveling times
    • DOI 10.1016/j.dam.2006.04.009, PII S0166218X06001879
    • H. Hashimoto, T. Ibaraki, S. Imahori, and M. Yagiura The vehicle routing problem with flexible time windows and traveling times Discrete Appl Math 154 2006 2271 2290 (Pubitemid 44287109)
    • (2006) Discrete Applied Mathematics , vol.154 , Issue.16 , pp. 2271-2290
    • Hashimoto, H.1    Ibaraki, T.2    Imahori, S.3    Yagiura, M.4
  • 20
    • 0033718405 scopus 로고    scopus 로고
    • A tabu search heuristic for the capacitated arc routing problem
    • A. Hertz, G. Laporte, and M. Mittaz A tabu search heuristic for the capacitated arc routing problem Oper Res 48 2000 129 135
    • (2000) Oper Res , vol.48 , pp. 129-135
    • Hertz, A.1    Laporte, G.2    Mittaz, M.3
  • 21
    • 19944391610 scopus 로고    scopus 로고
    • Effective local search algorithms for routing and scheduling problems with general time-window constraints
    • DOI 10.1287/trsc.1030.0085
    • T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithms for routing and scheduling problems with general time window constraints Transp Sci 39 2005 206 232 (Pubitemid 40748590)
    • (2005) Transportation Science , vol.39 , Issue.2 , pp. 206-232
    • Ibaraki, T.1    Imahori, S.2    Kubo, M.3    Masuda, T.4    Uno, T.5    Yagiura, M.6
  • 22
    • 84905858075 scopus 로고    scopus 로고
    • ILOG CPLEX optimizer 12.5
    • IBM, ILOG CPLEX optimizer 12.5, http://www-01.ibm.com/software/ integration/optimization/cplex-optimizer 2014.
    • (2014) IBM
  • 23
    • 0026857186 scopus 로고
    • An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints
    • Y. Koskosidis, W. Powell, and M. Solomon An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints Transp Sci 26 1992 69 85
    • (1992) Transp Sci , vol.26 , pp. 69-85
    • Koskosidis, Y.1    Powell, W.2    Solomon, M.3
  • 24
    • 73349128424 scopus 로고    scopus 로고
    • Fifty years of vehicle routing
    • G. Laporte Fifty years of vehicle routing Transp Sci 43 2009 408 416
    • (2009) Transp Sci , vol.43 , pp. 408-416
    • Laporte, G.1
  • 25
    • 33748779692 scopus 로고
    • A multiobjective vehicle routing problem with soft time windows the case of a public library distribution system
    • H. Min A multiobjective vehicle routing problem with soft time windows the case of a public library distribution system Socio-Econ Plan Sci 25 1991 179 188
    • (1991) Socio-Econ Plan Sci , vol.25 , pp. 179-188
    • Min, H.1
  • 26
    • 69249232196 scopus 로고    scopus 로고
    • An exact solution approach for vehicle routing and scheduling problems with soft time windows
    • A. Qureshi, E. Taniguchi, and T. Yamada An exact solution approach for vehicle routing and scheduling problems with soft time windows Transp Res Part E: Logist Transp Rev 45 2009 960 977
    • (2009) Transp Res Part E: Logist Transp Rev , vol.45 , pp. 960-977
    • Qureshi, A.1    Taniguchi, E.2    Yamada, T.3
  • 27
    • 77956629130 scopus 로고    scopus 로고
    • Exact solution for the vehicle routing problem with semi soft time windows and its application
    • A. Qureshi, E. Taniguchi, and T. Yamada Exact solution for the vehicle routing problem with semi soft time windows and its application Proc - Soc Behav Sci 2 2010 5931 5943
    • (2010) Proc - Soc Behav Sci , vol.2 , pp. 5931-5943
    • Qureshi, A.1    Taniguchi, E.2    Yamada, T.3
  • 28
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Oper Res 35 1987 254 265
    • (1987) Oper Res , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 29
    • 84866156744 scopus 로고    scopus 로고
    • Vehicle routing problem with stochastic travel times including soft time windows and service costs
    • D. Taş, N. Dellaert, T. Van Woensel, and T. de Kok Vehicle routing problem with stochastic travel times including soft time windows and service costs Comput Oper Res 40 2013 214 224
    • (2013) Comput Oper Res , vol.40 , pp. 214-224
    • Taş, D.1    Dellaert, N.2    Van Woensel, T.3    De Kok, T.4
  • 30
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J. Potvin A tabu search heuristic for the vehicle routing problems with soft time windows Comput Oper Res 31 1997 170 186 (Pubitemid 127597092)
    • (1997) Transportation Science , vol.31 , Issue.2 , pp. 170-186
    • Taillard, E.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.-Y.5
  • 31
    • 58149512336 scopus 로고    scopus 로고
    • Vehicle routing problem with fuzzy time windows
    • J. Tang, Z. Pan, R. Fung, and H. Lau Vehicle routing problem with fuzzy time windows Fuzzy Sets Syst 160 2009 683 695
    • (2009) Fuzzy Sets Syst , vol.160 , pp. 683-695
    • Tang, J.1    Pan, Z.2    Fung, R.3    Lau, H.4
  • 32
    • 0041791136 scopus 로고    scopus 로고
    • The vehicle routing problem, SIAM monographs on discrete mathematics and applications
    • Philadelphia
    • Toth P, Vigo D. The vehicle routing problem, SIAM monographs on discrete mathematics and applications, vol. 9, Society for Industrial and Applied Mathematics, Philadelphia; 2002.
    • (2002) Society for Industrial and Applied Mathematics , vol.9
    • Toth, P.1    Vigo, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.