José-Manuel Belenguer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
José-Manuel Belenguer has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
Enrique Benavent
5 shared publications- Christian Prins
University of Technology of Troyes
3 shared publications E. Benavent
Universitat de València Estudi General, Departament d’Estadística i Investigació Operativa, Facultat de Matemátiques, Doctor Moliner, 50, 46100 Burjassot, Valencia, Spain
3 shared publicationsCaroline Prodhon
Institut Charles Delaunay, Laboratoire d’Optimisation des Systémes Industriels (LOSI), Université de Technologie de Troyes, 10004 Troyes Cedex, France
2 shared publicationsChristian Prins
2 shared publications- Enrique Benavent
Departamento de Estadística e Investigación Operativa, Universitat de València, València, Spain
2 shared publications
Latest Publications
- 3 November 2026
- Published by Taylor & Francis in International Journal of Production Research
- p. 1-18
Improving ambulance coverage through the use of alternative return routes during vehicles' repositioning
1. Emergency Medical Services (EMS) organisations operate a fleet of vehicles to ensure timely responses to emergency events in their service areas. To achieve this, vehicles are assigned to strate...
- 3 November 2026
- Published by Taylor & Francis in International Journal of Production Research
- p. 1-18
Improving ambulance coverage through the use of alternative return routes during vehicles' repositioning
1. Emergency Medical Services (EMS) organisations operate a fleet of vehicles to ensure timely responses to emergency events in their service areas. To achieve this, vehicles are assigned to strate...
- Open Access
- 18 May 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 168
A branch-and-cut algorithm for a skip pick-up and delivery problem
- 18 May 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 168
Open AccessA branch-and-cut algorithm for a skip pick-up and delivery problem
- 1 May 2016
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 50 (2) , 735-749
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequalities for which we have developed different (exact and heuristic) separation procedures. Using these elements, we have implemented a branch-and-cut algorithm for the solution of the STTRPSD. A computational experiment with published instances shows that the proposed branch-and-cut algorithm consistently solves problems with up to 50 customers and 10 satellite depots, and it has also been able to solve instances with up to 20 satellite depots and 100 clustered customers.
- 1 May 2016
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 50 (2) , 735-749
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequalities for which we have developed different (exact and heuristic) separation procedures. Using these elements, we have implemented a branch-and-cut algorithm for the solution of the STTRPSD. A computational experiment with published instances shows that the proposed branch-and-cut algorithm consistently solves problems with up to 50 customers and 10 satellite depots, and it has also been able to solve instances with up to 20 satellite depots and 100 clustered customers.
- Top Cited Papers
- 1 June 2011
- Published by Elsevier in Computers & Operations Research
- Vol. 38 (6) , 931-941
A Branch-and-Cut method for the Capacitated Location-Routing Problem
- 1 June 2011
- Published by Elsevier in Computers & Operations Research
- Vol. 38 (6) , 931-941
Top Cited PapersA Branch-and-Cut method for the Capacitated Location-Routing Problem
- 1 May 2010
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 44 (2) , 206-220
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
This paper proposes lower and upper bounds for the split-delivery capacitated arc-routing problem (SDCARP), a variant of the capacitated arc-routing problem in which an edge can be serviced by several vehicles. Recent papers on related problems in node routing have shown that this policy can bring significant savings. It is also more realistic in applications such as urban refuse collection, where a vehicle can become full in the middle of a street segment. This work presents the first lower bound for the SDCARP, computed with a cutting plane algorithm and an evolutionary local search reinforced by a multistart procedure and a variable neighborhood descent. Tests on 126 instances show that the new metaheuristic outperforms on average a published memetic algorithm; achieves small deviations to the lower bound; and finds 44 optima, including 10 new ones.
- 1 May 2010
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 44 (2) , 206-220
Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic
This paper proposes lower and upper bounds for the split-delivery capacitated arc-routing problem (SDCARP), a variant of the capacitated arc-routing problem in which an edge can be serviced by several vehicles. Recent papers on related problems in node routing have shown that this policy can bring significant savings. It is also more realistic in applications such as urban refuse collection, where a vehicle can become full in the middle of a street segment. This work presents the first lower bound for the SDCARP, computed with a cutting plane algorithm and an evolutionary local search reinforced by a multistart procedure and a variable neighborhood descent. Tests on 126 instances show that the new metaheuristic outperforms on average a published memetic algorithm; achieves small deviations to the lower bound; and finds 44 optima, including 10 new ones.
- 1 December 2006
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (12) , 3363-3383
Lower and upper bounds for the mixed capacitated arc routing problem
- 1 December 2006
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (12) , 3363-3383
Lower and upper bounds for the mixed capacitated arc routing problem
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 38 (21611890) , 1541-1546
A Branch and Cut method for the Capacitated Location-Routing Problem
Most of the time in a distribution system, depot location and vehicle routing are interdependent and recent researches have shown that the overall system cost may be excessive if routing decisions are ignored when locating depots. The location routing problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. This paper presents two formulations of the location-routing problem with capacities on routes and depots and proposes an exact method based on a branch and cut approach using these formulations. The method is evaluated on two sets of randomly generated instances, and compared to heuristics and another lower bound
- 1 October 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 38 (21611890) , 1541-1546
A Branch and Cut method for the Capacitated Location-Routing Problem
Most of the time in a distribution system, depot location and vehicle routing are interdependent and recent researches have shown that the overall system cost may be excessive if routing decisions are ignored when locating depots. The location routing problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. This paper presents two formulations of the location-routing problem with capacities on routes and depots and proposes an exact method based on a branch and cut approach using these formulations. The method is evaluated on two sets of randomly generated instances, and compared to heuristics and another lower bound
- 31 October 2005
- Published by Elsevier in Journal of Food Engineering
- Vol. 70 (3) , 435-445
RutaRep: a computer package to design dispatching routes in the meat industry
- 31 October 2005
- Published by Elsevier in Journal of Food Engineering
- Vol. 70 (3) , 435-445
RutaRep: a computer package to design dispatching routes in the meat industry
- 1 April 2003
- Published by Elsevier in Computers & Operations Research
- Vol. 30 (5) , 705-728
A cutting plane algorithm for the capacitated arc routing problem
- 1 April 2003
- Published by Elsevier in Computers & Operations Research
- Vol. 30 (5) , 705-728
A cutting plane algorithm for the capacitated arc routing problem