0000000000117477

AUTHOR

Caroline Prodhon

showing 2 related works from this author

A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots

2016

International audience; 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 inequaliti…

Truck050210 logistics & transportationEngineering021103 operations researchHeuristic (computer science)business.industry05 social sciencesTrailer0211 other engineering and technologiesTransportation[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]02 engineering and technologyTravelling salesman problem0502 economics and businessVehicle routing problemRouting (electronic design automation)businessAlgorithmBranch and cutInteger programmingCivil and Structural EngineeringTransportation Science
researchProduct

A Branch-and-Cut method for the Capacitated Location-Routing Problem

2011

International audience; Recent researches in the design of logistic networks have shown that the overall distribution 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. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …

Dynamic Source RoutingMathematical optimizationGeneral Computer ScienceComputer scienceEqual-cost multi-path routingRouting tableTesting0211 other engineering and technologiesGeographic routingLogistics02 engineering and technologyManagement Science and Operations ResearchBranch and CutSimulated annealingStochastic processesBranch-and-CutLocation-RoutingVehicle routing problem0202 electrical engineering electronic engineering information engineeringFacility locationDestination-Sequenced Distance Vector routingRoutingMathematicsStatic routing021103 operations researchLocation routingLower BoundLinear modelVehiclesIterative algorithms[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Facility location problemVehicle routingCostsLocation-Routing ProblemLink-state routing protocolLagrangian functionsModeling and SimulationMultipath routing020201 artificial intelligence & image processingFittingRouting (electronic design automation)Branch and cutDrawback
researchProduct