IDEAS home Printed from https://ideas.repec.org/r/eee/ejores/v239y2014i1p102-111.html

Efficient elementary and restricted non-elementary route pricing

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as


Cited by:

  1. Nikolaus Furian & Michael O’Sullivan & Cameron Walker & Eranda Çela, 2021. "A machine learning-based branch and price algorithm for a sampled vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 693-732, September.
  2. Twan Dollevoet & Pedro Munari & Remy Spliet, 2026. "A p -Step Formulation for the Capacitated Vehicle Routing Problem," Transportation Science, INFORMS, vol. 60(1), pages 87-100, January.
  3. Xia, Yang & Zeng, Wenjia & Zhang, Canrong & Yang, Hai, 2023. "A branch-and-price-and-cut algorithm for the vehicle routing problem with load-dependent drones," Transportation Research Part B: Methodological, Elsevier, vol. 171(C), pages 80-110.
  4. Sheng Liu & Zhixing Luo, 2023. "On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand," Manufacturing & Service Operations Management, INFORMS, vol. 25(2), pages 595-612, March.
  5. Dayarian, Iman & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2015. "A column generation approach for a multi-attribute vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 241(3), pages 888-906.
  6. Thibaut Vidal & Rafael Martinelli & Tuan Anh Pham & Minh Hoàng Hà, 2021. "Arc Routing with Time-Dependent Travel Times and Paths," Transportation Science, INFORMS, vol. 55(3), pages 706-724, May.
  7. Dollevoet, T.A.B. & Munari, P. & Spliet, R., 2020. "A p-step formulation for the capacitated vehicle routing problem," Econometric Institute Research Papers EI2020-01, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
  8. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
  9. Yuan, Biao & Cui, Weiwei & Baldacci, Roberto, 2025. "An exact algorithm for a mobile production vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 201(C).
  10. Maria Fleischer Fauske & Carlo Mannino & Paolo Ventura, 2020. "Generalized Periodic Vehicle Routing and Maritime Surveillance," Transportation Science, INFORMS, vol. 54(1), pages 164-183, January.
  11. Xiangyi Zhang & Lu Chen & Michel Gendreau & André Langevin, 2022. "A Branch-and-Price-and-Cut Algorithm for the Vehicle Routing Problem with Two-Dimensional Loading Constraints," Transportation Science, INFORMS, vol. 56(6), pages 1618-1635, November.
  12. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
  13. Lu, Jiawei & Nie, Qinghui & Mahmoudi, Monirehalsadat & Ou, Jishun & Li, Chongnan & Zhou, Xuesong Simon, 2022. "Rich arc routing problem in city logistics: Models and solution algorithms using a fluid queue-based time-dependent travel time representation," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 143-182.
  14. Reihaneh, Mohammad & Ghoniem, Ahmed, 2019. "A branch-and-price algorithm for a vehicle routing with demand allocation problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 523-538.
  15. Munise Kübra Şahin & Hande Yaman, 2024. "The Vehicle Routing Problem with Access Restrictions," Transportation Science, INFORMS, vol. 58(5), pages 1101-1120, September.
  16. Boschetti, Marco Antonio & Maniezzo, Vittorio & Strappaveccia, Francesco, 2017. "Route relaxations on GPU for vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 456-466.
  17. Yao, Yu & Van Woensel, Tom & Veelenturf, Lucas P. & Mo, Pengli, 2021. "The consistent vehicle routing problem considering path consistency in a road network," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 21-44.
  18. Andreas Bärmann & Alexander Müller & Dieter Weninger, 2025. "Lexicographic column generation with a tree search pricing algorithm," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 102(2), pages 163-228, December.
  19. Letchford, Adam N. & Salazar-González, Juan-José, 2015. "Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem," European Journal of Operational Research, Elsevier, vol. 244(3), pages 730-738.
  20. Diego Pecin & Claudio Contardo & Guy Desaulniers & Eduardo Uchoa, 2017. "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 489-502, August.
  21. Zhenzhen Zhang & Yu Zhang & Roberto Baldacci, 2024. "Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework," Transportation Science, INFORMS, vol. 58(4), pages 761-780, July.
  22. Wei, Chenge & Che, Ada & Xue, Li, 2025. "A hierarchical integrated exact algorithm for multi-level capacitated arc routing problem in waste collection," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 204(C).
  23. Mathijs van Zon & Remy Spliet & Wilco van den Heuvel, 2021. "The Joint Network Vehicle Routing Game," Transportation Science, INFORMS, vol. 55(1), pages 179-195, 1-2.
  24. Huang, Nan & Qin, Hu & Du, Yuquan & Wang, Li, 2024. "An exact algorithm for the multi-trip vehicle routing problem with time windows and multi-skilled manpower," European Journal of Operational Research, Elsevier, vol. 319(1), pages 31-49.
  25. Nguyen, Tat Dat & Martinelli, Rafael & Pham, Quang Anh & Hà, Minh Hoàng, 2025. "The set team orienteering problem," European Journal of Operational Research, Elsevier, vol. 321(1), pages 75-87.
  26. Letchford, Adam N. & Salazar-González, Juan-José, 2019. "The Capacitated Vehicle Routing Problem: Stronger bounds in pseudo-polynomial time," European Journal of Operational Research, Elsevier, vol. 272(1), pages 24-31.
  27. Zhenzhen Zhang & Zhixing Luo & Hu Qin & Andrew Lim, 2019. "Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction," Transportation Science, INFORMS, vol. 53(2), pages 427-441, March.
  28. Fabian Torres & Michel Gendreau & Walter Rei, 2022. "Vehicle Routing with Stochastic Supply of Crowd Vehicles and Time Windows," Transportation Science, INFORMS, vol. 56(3), pages 631-653, May.
  29. Luciano Costa & Claudio Contardo & Guy Desaulniers, 2019. "Exact Branch-Price-and-Cut Algorithms for Vehicle Routing," Transportation Science, INFORMS, vol. 53(4), pages 946-985, July.
  30. Li, Jiliu & Xu, Min & Sun, Peng, 2022. "Two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 261-291.
  31. Bulhões, Teobaldo & Hà, Minh Hoàng & Martinelli, Rafael & Vidal, Thibaut, 2018. "The vehicle routing problem with service level constraints," European Journal of Operational Research, Elsevier, vol. 265(2), pages 544-558.
  32. Homsi, Gabriel & Martinelli, Rafael & Vidal, Thibaut & Fagerholt, Kjetil, 2020. "Industrial and tramp ship routing problems: Closing the gap for real-scale instances," European Journal of Operational Research, Elsevier, vol. 283(3), pages 972-990.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.