In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...

Amounts and proportions of subcutaneous, inter / intra muscular and internal fat depots were quantified by computer tomography (CT) at 10, 25, 50, 85 and 105 kg live weight in each of 141 animals of the three genetic groups: Norwegian Landrace, Duroc and a crossbreed between Norwegian Landrace and a line selected for high backfat and slow growth (LLP). Selection for reduced fat content at slaug...

The generalized multiple depot traveling salesmen problem (GMDTSP) is a variant of the multiple depot traveling salesmen problem (MDTSP), where each salesman starts at a distinct depot, the targets are partitioned into clusters and at least one target in each cluster is visited by some salesman. The GMDTSP is an NP-hard problem as it generalizes the MDTSP and has practical applications in desig...

This paper deals with the key issue of management to improve the allocation capability, facilitating the optimization of the objective in minimizing the cost, with the accuracy in dynamic allocation of nearest customers to depot. A method has been proposed to solve the Multi Depot Vehicle Routing Problem (MDVRP) based on Ant Algorithm which is a modified version of the traditional Ant colony Op...

This paper proposes two new distance-constrained capacitated vehicle routing problems (DCVRPs) to investigate for the first time, and study potential benefits in flexibly assigning start and end depots. The first problem, DCVRP Fix is an extension of the traditional symmetric DCVRP, with additional service and travel time constraints, minimization of the number of vehicles and flexible applicat...

We introduce the multimodal car- and ride-sharing problem (MMCRP), in which a pool of cars is used to cover set ride requests while uncovered are assigned other modes transport (MOT). A car’s route consists one or more trips. Each trip must have specific but non-predetermined driver, start depot finish (possibly different) depot. Ride-sharing between users allowed, even when two rides do not sa...