0000000000365952

AUTHOR

M. Grazia Speranza

showing 4 related works from this author

A branch-and-cut algorithm for the Orienteering Arc Routing Problem

2016

[EN] In arc routing problems, customers are located on arcs, and routes of minimum cost have to be identified. In the Orienteering Arc Routing Problem (OARP),in addition to a set of regular customers that have to be serviced, a set of potential customers is available. From this latter set, customers have to be chosen on the basis of an associated profit. The objective is to find a route servicing the customers which maximize the total profit collected while satisfying a given time limit on the route.In this paper, we describe large families of facet-inducing inequalities for the OARP and present a branch-and-cut algorithm for its solution. The exact algorithm embeds a procedure which builds…

Mathematical optimization021103 operations researchGeneral Computer Science0211 other engineering and technologiesOrienteering02 engineering and technologyManagement Science and Operations ResearchTime limitRouting problems with profitsPolyhedronExact algorithmOrienteering Arc Routing ProblemBranch-and-cutModeling and Simulation0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingDestination-Sequenced Distance Vector routingMATEMATICA APLICADAInteger programmingArc routingAlgorithmBranch and cutMathematicsComputers & Operations Research
researchProduct

A branch-and-cut algorithm for the Team Orienteering Problem

2017

The Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed. In this paper, we present a new two-index formulation with a polynomial number of variables and constraints. This compact formulation, reinforced by connectivity constraints, was solved by means of a branch-and-cut algorithm. The total number of instances solved to optimality is 327 of 387 benchmark instances, 26 more than any previous method. Moreover, 24 not previously solved instances were closed to optimality.

branch-and-cut algorithm; Team Orienteering Problem; two-index mathematical formulation; Computer Science Applications1707 Management Science and Operations Research;0209 industrial biotechnologyMathematical optimization021103 operations researchStrategy and Management0211 other engineering and technologiesOrienteering02 engineering and technologyManagement Science and Operations ResearchComputer Science Applicationstwo-index mathematical formulationTravel timeComputer Science Applications1707 Management Science and Operations Research020901 industrial engineering & automationManagement of Technology and InnovationBenchmark (computing)Limit (mathematics)branch-and-cut algorithmTeam Orienteering ProblemBusiness and International ManagementBranch and cutAlgorithmPolynomial numberMathematics
researchProduct

Formulations for an inventory routing problem

2014

In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.

Inventory routing problemMathematical optimizationSupply chain managementRouting problemsComputer scienceStrategy and ManagementAggregate (data warehouse)Branch-and-cut algorithmInteger programmingManagement Science and Operations ResearchComputer Science ApplicationsDiscrete time and continuous timeManagement of Technology and InnovationBenchmark (computing)MinificationBusiness and International ManagementInteger programmingSupply chain managementInternational Transactions in Operational Research
researchProduct

A matheuristic for the Team Orienteering Arc Routing Problem

2015

In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…

MatheuristicMathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputer scienceOrienteeringDirected graphManagement Science and Operations ResearchUpper and lower boundsIndustrial and Manufacturing EngineeringVertex (geometry)Constraint (information theory)Set (abstract data type)Routing problems with profitsArc routing problemModeling and SimulationBenchmark (computing)Team Orienteering ProblemDuration (project management)MATEMATICA APLICADAArc routing
researchProduct