Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for such games. In this paper, we define a very general class of games, called integer minimization games, which includes the combinatorial optimization games in the literature as special cases. We then present new techniq...

In this paper we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of the matheuristics: decomposition approaches, im...

We consider a pickup and delivery vehicle routing problem (PDP) commonly found in the realworld logistics operations. The problem includes a set of practical complications that have received little attention in the vehicle routing literature. There are multiple vehicle types available to cover a set of transportation orders with different pickup and delivery time windows. Transportation orders ...

mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. this issue renders the proposed mathematical models inapplicable due largely to the fact th...

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

Vehicle routing problems (VRPs) are concerned with the design of efficient routes that deliver goods and services from (to) central depots to (from) customer locations, satisfying specific business constraints. In the last 50 years, a vast amount of research has been devoted to solve different VRP variants. Nonetheless, most of the solution methods for VRPs are based on the premise that problem...

In this paper we describe a new parallel tabu search heuristic for the vehicle routing problem with time window constraints (VRPTW). The neighborhood structure we propose is based on simple customer shifts and allows to consider infeasible interim-solutions. Similar to the column generation approach used in exact algorithms , all routes generated by the tabu search heuristic are collected in a ...

This paper presents a heuristic column generation method for solving vehicle routing problems with a heterogeneous fleet of vehicles.The method may also solve the fleet size and composition vehicle routing problem and new best known solutions are reported for a set of classical problems. Numerical results show that the method is robust and efficient, particularly for medium and large size probl...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...