39
Views
58
CrossRef citations to date
0
Altmetric
Case-oriented Paper

Split-delivery routeing heuristics in livestock feed distribution

, &
Pages 107-116 | Received 01 Oct 1995, Accepted 01 Jun 1996, Published online: 20 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (3)

Ram Kumar Dhurkari, Anjan Kumar Swain & Sanjeeb Kumar Patjoshi. (2021) Vehicle routing and capacity planning : A three-phase algorithm. Journal of Information and Optimization Sciences 42:8, pages 1923-1942.
Read now
U Derigs, B Li & U Vogel. (2010) Local search-based metaheuristics for the split delivery vehicle routing problem. Journal of the Operational Research Society 61:9, pages 1356-1364.
Read now
H-J Kim, Y-D Kim & D-H Lee. (2005) Scheduling for an arc-welding robot considering heat-caused distortion. Journal of the Operational Research Society 56:1, pages 39-50.
Read now

Articles from other publishers (55)

Isaac Balster, Teobaldo Bulhões, Pedro Munari, Artur Alves Pessoa & Ruslan Sadykov. (2023) A New Family of Route Formulations for Split Delivery Vehicle Routing Problems. Transportation Science 57:5, pages 1359-1378.
Crossref
Marvin Caspar, Daniel Schermer & Oliver Wendt. 2023. Computational Science and Its Applications – ICCSA 2023. Computational Science and Its Applications – ICCSA 2023 82 98 .
Qidong Lai, Zizhen Zhang, Mingzhu Yu & Jiahai Wang. (2022) Split-Delivery Capacitated Arc-Routing Problem With Time Windows. IEEE Transactions on Intelligent Transportation Systems 23:3, pages 2882-2887.
Crossref
Hanane El Raoui, Mustapha Oudani, David A. Pelta & Ahmed El Hilali Alaoui. (2021) A Metaheuristic Based Approach for the Customer-Centric Perishable Food Distribution Problem. Electronics 10:16, pages 2018.
Crossref
Ángel Corberán, Richard Eglese, Geir Hasle, Isaac Plana & José María Sanchis. (2020) Arc routing problems: A review of the past, present, and future. Networks 77:1, pages 88-115.
Crossref
Jordan MacLachlan, Yi Mei, Juergen Branke & Mengjie Zhang. (2020) Genetic Programming Hyper-Heuristics with Vehicle Collaboration for Uncertain Capacitated Arc Routing Problems. Evolutionary Computation 28:4, pages 563-593.
Crossref
Juan David Cortes & Yoshinori Suzuki. (2020) Vehicle Routing with Shipment Consolidation. International Journal of Production Economics 227, pages 107622.
Crossref
Sameh M. Saad & Ramin Bahadori. (2020) Development of a Dynamic Information Fractal Framework to Monitor and Optimise Sustainability in Food Distribution Network. International Journal of Food Engineering 16:5-6.
Crossref
Ru-Bing Chen, Ling-Fa Lu, Jin-Jiang Yuan & Li-Qi Zhang. (2018) Improved Approximation Algorithm for Scheduling on a Serial Batch Machine with Split-Allowed Delivery. Journal of the Operations Research Society of China 8:1, pages 133-143.
Crossref
Mingzhu Yu, Xin Jin, Zizhen Zhang, Hu Qin & Qidong Lai. (2019) The split-delivery mixed capacitated arc-routing problem: Applications and a forest-based tabu search approach. Transportation Research Part E: Logistics and Transportation Review 132, pages 141-162.
Crossref
Roque M Guitián de Frutos & Balbina Casas-Méndez. (2019) Routing problems in agricultural cooperatives: a model for optimization of transport vehicle logistics. IMA Journal of Management Mathematics 30:4, pages 387-412.
Crossref
Nicola Bianchessi & Stefan Irnich. (2019) Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. Transportation Science 53:2, pages 442-462.
Crossref
Kristoko Dwi Hartomo, Hindriyanto Dwi Purnomo & Muchamad Taufiq Anwar. (2017) Routing model for medium disaster relief operations. Routing model for medium disaster relief operations.
E. Santoro, E.M. Soler & A.C. Cherri. (2017) Route optimization in mechanized sugarcane harvesting. Computers and Electronics in Agriculture 141, pages 140-146.
Crossref
Sophie N. Parragh, Jorge Pinho de Sousa & Bernardo Almada-Lobo. (2015) The Dial-a-Ride Problem with Split Requests and Profits. Transportation Science 49:2, pages 311-334.
Crossref
Leonardo Berbotto, Sergio García & Francisco J. Nogales. (2013) A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem. Annals of Operations Research 222:1, pages 153-173.
Crossref
Juan Sepúlveda, John Wilmer Escobar & Wilson Adarme-Jaimes. (2014) An algorithm for the routing problem with split deliveries and time windows (SDVRPTW) applied on retail SME distribution activities. DYNA 81:187, pages 223-231.
Crossref
Joseph Hubert Wilck IV & Tom M. Cavalier. (2014) A Column Generation Procedure for the Split Delivery Vehicle Routing Problem Using a Route-Based Formulation. International Journal of Operations Research and Information Systems 5:4, pages 44-63.
Crossref
Marcela Monroy-Licht, Ciro Alberto Amaya & André Langevin. (2014) The Rural Postman Problem with time windows. Networks 64:3, pages 169-180.
Crossref
An-Yang Liang & Dan Lin. (2014) Crossover Iterated Local Search for SDCARP. Journal of the Operations Research Society of China 2:3, pages 351-367.
Crossref
Pedro Amorim, Sophie N. Parragh, Fabrício Sperandio & Bernardo Almada-Lobo. (2012) A rich vehicle routing problem dealing with perishable food: a case study. TOP 22:2, pages 489-508.
Crossref
Yong Wang, Xiao-lei Ma, Yun-teng Lao, Hai-yan Yu & Yong Liu. (2014) A two-stage heuristic method for vehicle routing problem with split deliveries and pickups. Journal of Zhejiang University SCIENCE C 15:3, pages 200-210.
Crossref
Zhou Xu, Xiaofan Lai, Andrew Lim & Fan Wang. (2013) An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. Networks 63:2, pages 179-195.
Crossref
Patrícia Belfiore & Hugo T.Y. Yoshizaki. (2013) Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Computers & Industrial Engineering 64:2, pages 589-601.
Crossref
Yong WangXiaolei MaYunteng LaoYinhai WangHaijun Mao. (2013) Vehicle Routing Problem. Transportation Research Record: Journal of the Transportation Research Board 2378:1, pages 120-128.
Crossref
Alain Hertz, Marc Uldry & Marino Widmer. (2012) Integer linear programming models for a cement delivery problem. European Journal of Operational Research 222:3, pages 623-631.
Crossref
Myoung-Ju Park & Moon-Gul Lee. (2012) A Scalable Heuristic for Pickup-and-Delivery of Splittable Loads and Its Application to Military Cargo-Plane Routing. Management Science and Financial Engineering 18:1, pages 27-37.
Crossref
Joseph Hubert Wilck IV & Tom M. Cavalier. (2012) A Genetic Algorithm for the Split Delivery Vehicle Routing Problem. American Journal of Operations Research 02:02, pages 207-216.
Crossref
Joseph Hubert Wilck IV & Tom M. Cavalier. (2012) A Construction Heuristic for the Split Delivery Vehicle Routing Problem. American Journal of Operations Research 02:02, pages 153-162.
Crossref
C. Archetti & M. G. Speranza. (2013) Vehicle routing problems with split deliveries. International Transactions in Operational Research 19:1-2, pages 3-22.
Crossref
Nacima Labadie & Christian Prins. 2012. Production Systems and Supply Chain Management in Emerging Countries: Best Practices. Production Systems and Supply Chain Management in Emerging Countries: Best Practices 141 166 .
C. Archetti, M. Bouchard & G. Desaulniers. (2011) Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows. Transportation Science 45:3, pages 285-298.
Crossref
Damon Gulczynski, Bruce Golden & Edward Wasil. (2010) The split delivery vehicle routing problem with minimum delivery amounts. Transportation Research Part E: Logistics and Transportation Review 46:5, pages 612-626.
Crossref
Rafael E. Aleman, Xinhui Zhang & Raymond R. Hill. (2008) An adaptive memory algorithm for the split delivery vehicle routing problem. Journal of Heuristics 16:3, pages 441-473.
Crossref
José-Manuel Belenguer, Enrique Benavent, Nacima Labadi, Christian Prins & Mohamed Reghioui. (2010) Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic. Transportation Science 44:2, pages 206-220.
Crossref
Guy Desaulniers. (2010) Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows. Operations Research 58:1, pages 179-192.
Crossref
Patrı´cia Belfiore & Hugo Tsugunobu Yoshida Yoshizaki. (2009) Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. European Journal of Operational Research 199:3, pages 750-758.
Crossref
Ke Tang, Yi Mei & Xin Yao. (2009) Memetic Algorithm With Extended Neighborhood Search for Capacitated Arc Routing Problems. IEEE Transactions on Evolutionary Computation 13:5, pages 1151-1166.
Crossref
Saman Eskandarzadeh, Reza Tavakkoli-Moghaddam & Amir Azaron. (2007) An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems. Journal of Combinatorial Optimization 17:2, pages 214-234.
Crossref
Shuguang Liu, Lei Lei & Sunju Park. (2008) On the multi-product packing-delivery problem with a fixed route. Transportation Research Part E: Logistics and Transportation Review 44:3, pages 350-360.
Crossref
Mingzhou Jin, Kai Liu & Burak Eksioglu. (2008) A column generation approach for the split delivery vehicle routing problem. Operations Research Letters 36:2, pages 265-270.
Crossref
Claudia Archetti, M. Grazia Speranza & Martin W. P. Savelsbergh. (2008) An Optimization-Based Heuristic for the Split Delivery Vehicle Routing Problem. Transportation Science 42:1, pages 22-31.
Crossref
Vicente Campos, Angel Corberán & Enrique Mota. 2008. Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management. Advances in Computational Intelligence in Transport, Logistics, and Supply Chain Management 137 152 .
Claudia Archetti & Maria Grazia Speranza. 2008. The Vehicle Routing Problem: Latest Advances and New Challenges. The Vehicle Routing Problem: Latest Advances and New Challenges 103 122 .
Wei Yi & Arun Kumar. (2007) Ant colony optimization for disaster relief operations. Transportation Research Part E: Logistics and Transportation Review 43:6, pages 660-672.
Crossref
Si Chen, Bruce Golden & Edward Wasil. (2007) The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results. Networks 49:4, pages 318-329.
Crossref
Mingzhou Jin, Kai Liu & Royce O. Bowden. (2007) A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem. International Journal of Production Economics 105:1, pages 228-242.
Crossref
Enrique Mota, Vicente Campos & Ángel Corberán. 2007. Evolutionary Computation in Combinatorial Optimization. Evolutionary Computation in Combinatorial Optimization 121 129 .
Claudia Archetti & Maria Grazia Speranza. 2007. Operations Research Proceedings 2006. Operations Research Proceedings 2006 123 127 .
Patrícia Prado Belfiore & Hugo Tsugunobu Yoshida Yoshizaki. (2006) Scatter search para problemas de roteirização de veículos com frota heterogênea, janelas de tempo e entregas fracionadas. Production 16:3, pages 455-469.
Crossref
Claudia Archetti, Martin W. P. Savelsbergh & M. Grazia Speranza. (2006) Worst-Case Analysis for Split Delivery Vehicle Routing Problems. Transportation Science 40:2, pages 226-234.
Crossref
C. Archetti, M. G. Speranza & A. Hertz. (2006) A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem. Transportation Science 40:1, pages 64-73.
Crossref
S.C. Ho & D. Haugland. (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Computers & Operations Research 31:12, pages 1947-1964.
Crossref
J. M. Belenguer, M. C. Martinez & E. Mota. (2000) A Lower Bound for the Split Delivery Vehicle Routing Problem. Operations Research 48:5, pages 801-810.
Crossref
Moshe Dror, Janny M. Y. Leung & Paul A. Mullaseril. 2000. Arc Routing. Arc Routing 443 464 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.