1. The full truckload pickup and delivery problem with truck platooning. (2025). Wang, Yilin ; Zhang, Junlong.
   In: Transportation Research Part E: Logistics and Transportation Review.
   RePEc:eee:transe:v:193:y:2025:i:c:s136655452400437x.

   Full description at Econpapers || Download paper

2. A review of recent advances in time-dependent vehicle routing. (2024). Adamo, Tommaso ; Gendreau, Michel ; Ghiani, Gianpaolo ; Guerriero, Emanuela.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:319:y:2024:i:1:p:1-15.

   Full description at Econpapers || Download paper

3. Exact and anytime approach for solving the time dependent traveling salesman problem with time windows. (2023). Fontaine, Romain ; Dibangoye, Jilles ; Solnon, Christine.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:311:y:2023:i:3:p:833-844.

   Full description at Econpapers || Download paper

4. Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation. (2022). Zhou, Xuesong Simon ; Nie, Qinghui ; Mahmoudi, Monirehalsadat ; Lu, Jiawei ; Li, Chongnan.
   In: Transportation Research Part B: Methodological.
   RePEc:eee:transb:v:166:y:2022:i:c:p:143-182.

   Full description at Econpapers || Download paper

1. Abeledo, H.G. ; Fukasawa, R. ; Pessoa, A.A. ; Uchoa, E. The time dependent traveling salesman problem: Polyhedra and algorithm. 2013 Mathematical Programming Computation. 5 27-55
   Paper not yet in RePEc: Add citation now
   

2. Albiach, J. ; Sanchis, J.M. ; Soler, D. An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. 2008 European Journal of Operational Research. 189 789-802

3. Archetti, C. ; Bertazzi, L. Recent challenges in routing and inventory routing: E-commerce and last-mile delivery. 2021 Networks. 77 255-268
   Paper not yet in RePEc: Add citation now
   
4. Arigliano, A. ; Ghiani, G. ; Grieco, A. ; Guerriero, E. ; Plana, I. Time-dependent asymmetric traveling salesman problem with time windows: Properties and an exact algorithm. 2018 Discrete Applied Mathematics. -
   Paper not yet in RePEc: Add citation now
   
5. Ascheuer, N. ; Fischetti, M. ; Grötschel, M. A polyhedral study of the asymmetric traveling salesman problem with time windows. 2000 Networks. 36 69-79
   Paper not yet in RePEc: Add citation now
   
6. Ascheuer, N. ; Fischetti, M. ; Grötschel, M. Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. 2001 Mathematical Programming. 90 475-506
   Paper not yet in RePEc: Add citation now
   

7. Balas, E. New classes of efficiently solvable generalized traveling salesman problems. 1999 Annals OR. 86 529-558

8. Balas, E. ; Simonetti, N. Linear time dynamic-programming algorithms for new classes of restricted TSPs: A computational study. 2001 INFORMS Journal on Computing. 13 56-75

9. Baldacci, R. ; Mingozzi, A. ; Roberti, R. New state-space relaxations for solving the traveling salesman problem with time windows. 2012 INFORMS Journal on Computing. 24 356-371

10. Boland, N. ; Hewitt, M. ; Marshall, L. ; Savelsbergh, M. The continuous-time service network design problem. 2017 Operations Research. 65 1303-1321

11. Boland, N. ; Hewitt, M. ; Vu, D.M. ; Savelsbergh, M. Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. 2017 En : Salvagnin, D. ; Lombardi, M. Integration of AI and OR techniques in constraint programming. Cham:Springer International Publishing:
    Paper not yet in RePEc: Add citation now
    
12. Boland, N. ; Hewitt, M. ; Vu, D.M. ; Savelsbergh, M. Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. 2017 En : Salvagnin, D. ; Lombardi, M. Integration of AI and OR techniques in constraint programming. Springer International Publishing:
    Paper not yet in RePEc: Add citation now
    

13. Boland, N.L. ; Savelsbergh, M.W. Perspectives on integer programming for time-dependent models. 2019 Top. 27 147-173

14. Bront, J.J.M. ; Méndez-Díaz, I. ; Zabala, P. Facets and valid inequalities for the time-dependent travelling salesman problem. 2014 European Journal of Operational Research. 236 891-902

15. Christofides, N. ; Mingozzi, A. ; Toth, P. State-space relaxation procedures for the computation of bounds to routing problems. 1981 Networks. 11 145-164
    Paper not yet in RePEc: Add citation now
    

16. Clautiaux, F. ; Hanafi, S. ; Macedo, R. ; Voge, M.-E. ; Alves, C. Iterative aggregation and disaggregation algorithm for pseudo-polynomial network ow models with side constraints. 2017 European Journal of Operational Research. 258 467-477

17. Cordeau, J.-F. ; Ghiani, G. ; Guerriero, E. Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. 2014 Transportation Science. 48 46-58

18. Dabia, S. ; Ropke, S. ; Van Woensel, T. ; De Kok, T. Branch and price for the time-dependent vehicle routing problem with time windows. 2013 Transportation Science. 47 380-396

19. Dash, S. ; Günlük, O. ; Lodi, A. ; Tramontani, A. A time bucket formulation for the traveling salesman problem with time windows. 2012 INFORMS Journal on Computing. 24 132-147

20. Dumas, Y. ; Desrosiers, J. ; Gélinas, E. ; Solomon, M.M. An optimal algorithm for the traveling salesman problem with time windows. 1995 Operations Research. 43 367-371

21. Franceschi, R.D. ; Fischetti, M. ; Toth, P. A new ILP-based refinement heuristic for vehicle routing problems. 2006 Mathematical Programming. 105 471-499
    Paper not yet in RePEc: Add citation now
    

22. Ghiani, G. ; Guerriero, E. A note on the Ichoua, Gendreau, and Potvin (2003) travel time model. 2014 Transportation Science. 48 458-462

23. Goel, A. The minimum duration truck driver scheduling problem. 2012 EURO Journal on Transportation and Logistics. 1 285-306
    Paper not yet in RePEc: Add citation now
    

24. Gouveia, L. ; Voz, S. A classification of formulations for the (time-dependent) traveling salesman problem. 1995 European Journal of Operational Research. 83 69-82

25. Heilporn, G. ; Cordeau, J.-F. ; Laporte, G. The delivery man problem with time windows. 2010 Discrete Optimization. 7 269-282
    Paper not yet in RePEc: Add citation now
    

26. Hewitt, M. Enhanced dynamic discretization discovery for the continuous time load plan design problem. 2019 Transportation Science. 53 1731-1750

27. Hewitt, M. ; Boland, N. ; Savelsbergh, M. ; Hewitt, M. Interval-based dynamic discretization discovery for solving the continuous-time service network design problem. 2021 Transportation Science. 55 29-51

28. Ichoua, S. ; Gendreau, M. ; Potvin, J.-Y. Vehicle dispatching with time-dependent travel times. 2003 European Journal of Operational Research. 144 379-396

29. Kara, I. ; Derya, T. Formulations for minimizing tour duration of the traveling salesman problem with time windows. 2015 Procedia Economics and Finance. 26 1026-1034
    Paper not yet in RePEc: Add citation now
    
30. Lucena, A. Time-dependent traveling salesman problem-the deliveryman case. 1990 Networks. 20 753-763
    Paper not yet in RePEc: Add citation now
    

31. Medina, J. ; Hewitt, M. ; Lehud, F. ; Pton, O. Integrating long-haul and local transportation planning: the service network design and routing problem. 2019 EURO Journal on Transportation and Logistics. 8 119-145

32. Melgarejo, P.A. ; Laborie, P. ; Solnon, C. A time-dependent no-overlap constraint: Application to urban delivery problems. 2015 :
    Paper not yet in RePEc: Add citation now
    
33. Méndez-Díaz, I. ; Bront, J.J.M. ; Toth, P. ; Zabala, P. Infeasible path formulations for the time-dependent TSP with time windows. 2011 :
    Paper not yet in RePEc: Add citation now
    

34. Mingozzi, A. ; Bianco, L. ; Ricciardelli, S. Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints. 1997 Operations Research. 45 365-377

35. Montero, A. ; Méndez-Dıaz, I. ; Miranda-Bront, J.J. An integer programming approach for the time-dependent traveling salesman problem with time windows. 2017 Computers & Operations Research. 88 280-289
    Paper not yet in RePEc: Add citation now
    

36. Picard, J.-C. ; Queyranne, M. The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. 1978 Operations Research. 26 86-110

37. Roberti, R. ; Mingozzi, A. Dynamic ng-path relaxation for the delivery man problem. 2014 Transportation Science. 48 413-424

38. Salehipour, A. ; Sörensen, K. ; Goos, P. ; Bräysy, O. Efficient GRASP+ VND and GRASP+ VNS metaheuristics for the traveling repairman problem. 2011 4or. 9 189-209
    Paper not yet in RePEc: Add citation now
    
39. Savelsbergh, M.W.P. The vehicle routing problem with time windows: Minimizing route duration. 1992 ORSA Journal on Computing. 4 146-154
    Paper not yet in RePEc: Add citation now
    

40. Scherr, Y.O. ; Hewitt, M. ; Saavedra, B.A.N. ; Mattfeld, D.C. Dynamic discretization discovery for the service network design problem with mixed autonomous fleets. 2020 Transportation Research Part B: Methodological. 141 164-195

41. Silva, M.M. ; Subramanian, A. ; Vidal, T. ; Ochi, L.S. A simple and effective metaheuristic for the minimum latency problem. 2012 European Journal of Operational Research. 221 513-520

42. Stecco, G. ; Cordeau, J.-F. ; Moretti, E. A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times. 2008 Computers & Operations Research. 35 2635-2655
    Paper not yet in RePEc: Add citation now
    

43. Sun, P. ; Veelenturf, L.P. ; Hewitt, M. ; Van Woensel, T. The time-dependent pickup and delivery problem with time windows. 2018 Transportation Research Part B: Methodological. 116 1-24

44. Tas, D. ; Gendreau, M. ; Jabali, O. ; Laporte, G. The traveling salesman problem with time-dependent service times. 2016 European Journal of Operational Research. 248 372-383

45. Tilk, C. ; Irnich, S. Dynamic programming for the minimum tour duration problem. 2017 Transportation Science. 51 549-565

46. Vu, D.M. ; Hewitt, M. ; Boland, N. ; Savelsbergh, M. Dynamic discretization discovery for solving the time-dependent traveling salesman problem with time windows. 2020 Transportation Science. 54 703-720
    Paper not yet in RePEc: Add citation now
    

1. Sustainable Time-Dependent Cheapest Path Problem with Integrated Collaborative Stakeholders’ Perspectives. (2024). Gautama, Sidharta ; Semanjski, Ivana.
   In: Sustainability.
   RePEc:gam:jsusta:v:16:y:2024:i:9:p:3706-:d:1385261.

   Full description at Econpapers || Download paper

2. A review of recent advances in time-dependent vehicle routing. (2024). Adamo, Tommaso ; Gendreau, Michel ; Ghiani, Gianpaolo ; Guerriero, Emanuela.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:319:y:2024:i:1:p:1-15.

   Full description at Econpapers || Download paper

3. Dealing with time in the multiple traveling salespersons problem with moving targets. (2022). Fugenschuh, Armin ; Stieber, Anke.
   In: Central European Journal of Operations Research.
   RePEc:spr:cejnor:v:30:y:2022:i:3:d:10.1007_s10100-020-00712-7.

   Full description at Econpapers || Download paper

4. Development of Methods for Route Optimization of Work in Inhomogeneous Radiation Fields to Minimize the Dose Load of Personnel. (2022). Tashlykov, Oleg L ; Chentsov, Alexei A ; Sesekin, Alexander N.
   In: Energies.
   RePEc:gam:jeners:v:15:y:2022:i:13:p:4788-:d:851782.

   Full description at Econpapers || Download paper

5. A two-stage stochastic programming model for seaport berth and channel planning with uncertainties in ship arrival and handling times. (2022). Li, Zhi-Chun ; Wang, Yadong ; Liu, Baoli.
   In: Transportation Research Part E: Logistics and Transportation Review.
   RePEc:eee:transe:v:167:y:2022:i:c:s1366554522002964.

   Full description at Econpapers || Download paper

6. Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery. (2022). Hewitt, Mike ; Vu, Duc Minh.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:302:y:2022:i:3:p:831-846.

   Full description at Econpapers || Download paper

7. Last-mile delivery concepts: a survey from an operational research perspective. (2021). Schwerdfeger, Stefan ; Fedtke, Stefan ; Boysen, Nils.
   In: OR Spectrum: Quantitative Approaches in Management.
   RePEc:spr:orspec:v:43:y:2021:i:1:d:10.1007_s00291-020-00607-8.

   Full description at Econpapers || Download paper

8. Scheduling for multi-robot routing with blocking and enabling constraints. (2021). Rubinstein, Zachary B ; Smith, Stephen F ; Kinable, Joris ; Mogali, Jayanth Krishna.
   In: Journal of Scheduling.
   RePEc:spr:jsched:v:24:y:2021:i:3:d:10.1007_s10951-021-00684-9.

   Full description at Econpapers || Download paper

9. Single-machine scheduling with release times, deadlines, setup times, and rejection. (2021). Baart, Robert ; de Weerdt, Mathijs ; He, Lei.
   In: European Journal of Operational Research.
   RePEc:eee:ejores:v:291:y:2021:i:2:p:629-639.

   Full description at Econpapers || Download paper

10. A time-dependent hierarchical Chinese postman problem. (2020). Yilmaz, Mustafa ; Odur, Merve Kayaci.
    In: Central European Journal of Operations Research.
    RePEc:spr:cejnor:v:28:y:2020:i:1:d:10.1007_s10100-018-0598-8.

    Full description at Econpapers || Download paper

11. New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem. (2020). Irnich, Stefan ; Schmidt, Jeanette.
    In: Working Papers.
    RePEc:jgu:wpaper:2020.

    Full description at Econpapers || Download paper

12. Electric Vehicle Tour Planning Considering Range Anxiety. (2020). Liu, Xinglu ; Chen, Rui ; Yang, Peng ; Miao, Lixin.
    In: Sustainability.
    RePEc:gam:jsusta:v:12:y:2020:i:9:p:3685-:d:353389.

    Full description at Econpapers || Download paper

13. Perspectives on integer programming for time-dependent models. (2019). Boland, Natashia L.
    In: TOP: An Official Journal of the Spanish Society of Statistics and Operations Research.
    RePEc:spr:topjnl:v:27:y:2019:i:2:d:10.1007_s11750-019-00514-4.

    Full description at Econpapers || Download paper

14. Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem. (2019). Hintsch, Timo.
    In: Working Papers.
    RePEc:jgu:wpaper:1904.

    Full description at Econpapers || Download paper

15. Large multiple neighborhood search for the clustered vehicle-routing problem. (2018). Hintsch, Timo ; Irnich, Stefan.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:270:y:2018:i:1:p:118-131.

    Full description at Econpapers || Download paper

16. The multi-stripe travelling salesman problem. (2017). Deineko, Vladimir G ; Woeginger, Gerhard J ; Ela, Eranda.
    In: Annals of Operations Research.
    RePEc:spr:annopr:v:259:y:2017:i:1:d:10.1007_s10479-017-2513-4.

    Full description at Econpapers || Download paper

17. Large Multiple Neighborhood Search for the Clustered Vehicle-Routing Problem. (2017). Hintsch, Timo ; Irnich, Stefan.
    In: Working Papers.
    RePEc:jgu:wpaper:1701.

    Full description at Econpapers || Download paper

18. Dynamic Programming for the Minimum Tour Duration Problem. (2017). Irnich, Stefan ; Tilk, Christian.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:51:y:2017:i:2:p:549-565.

    Full description at Econpapers || Download paper

19. Hybrid optimization methods for time-dependent sequencing problems. (2017). van Hoeve, Willem-Jan ; Kinable, Joris ; Cire, Andre A.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:259:y:2017:i:3:p:887-897.

    Full description at Econpapers || Download paper

20. The Time Dependent Traveling Salesman Planning Problem in Controlled Airspace. (2016). Toth, Paolo ; Furini, Fabio ; Persiani, Carlo Alfredo .
    In: Transportation Research Part B: Methodological.
    RePEc:eee:transb:v:90:y:2016:i:c:p:38-55.

    Full description at Econpapers || Download paper

21. Dynamic Programming for the Minimum Tour Duration Problem. (2014). Irnich, Stefan ; Tilk, Christian.
    In: Working Papers.
    RePEc:jgu:wpaper:1408.

    Full description at Econpapers || Download paper

22. Analysis and Branch-and-Cut Algorithm for the Time-Dependent Travelling Salesman Problem. (2014). Cordeau, Jean-Franois ; Ghiani, Gianpaolo ; Guerriero, Emanuela.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:48:y:2014:i:1:p:46-58.

    Full description at Econpapers || Download paper

23. Multivalued Decision Diagrams for Sequencing Problems. (2013). van Hoeve, Willem-Jan ; Cire, Andre A.
    In: Operations Research.
    RePEc:inm:oropre:v:61:y:2013:i:6:p:1411-1428.

    Full description at Econpapers || Download paper

24. Optimal ship navigation with safety distance and realistic turn constraints. (2013). Aksakalli, Vural ; Aydogdu, Volkan ; Kum, Serdar ; Ari, Ibrahim.
    In: European Journal of Operational Research.
    RePEc:eee:ejores:v:229:y:2013:i:3:p:707-717.

    Full description at Econpapers || Download paper

25. A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows. (2012). Dash, Sanjeeb ; Gunluk, Oktay ; Tramontani, Andrea ; Lodi, Andrea.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:24:y:2012:i:1:p:132-147.

    Full description at Econpapers || Download paper

26. Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands. (2009). Secomandi, Nicola ; Margot, Franois .
    In: Operations Research.
    RePEc:inm:oropre:v:57:y:2009:i:1:p:214-230.

    Full description at Econpapers || Download paper

27. Traveling Salesman Problems with Profits. (2005). Dejax, Pierre ; Gendreau, Michel ; Feillet, Dominique.
    In: Transportation Science.
    RePEc:inm:ortrsc:v:39:y:2005:i:2:p:188-205.

    Full description at Econpapers || Download paper

28. An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem. (2002). van De, Steef L ; Congram, Richard K ; Potts, Chris N.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:14:y:2002:i:1:p:52-67.

    Full description at Econpapers || Download paper

29. Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study. (2001). Simonetti, Neil ; Balas, Egon.
    In: INFORMS Journal on Computing.
    RePEc:inm:orijoc:v:13:y:2001:i:1:p:56-75.

    Full description at Econpapers || Download paper

Report date: 2025-10-05 20:26:47 || Missing content? Let us know