The vehicle-routing problem (VRP) has many variants, including the most accurate models of real-life transportation tasks, making it one important mathematical problems in field logistics. Our goal was to design an algorithm that can race against recent solutions for VRP and capacitated (CVRP), while also being applicable with simulations real transports. is a variant bacterial memetic (BMA), w...

This work proposes a partial optimization metaheuristic under special intensification conditions (POPMUSIC) for the classical capacitated vehicle routing problem. The proposed approach uses branch-cut-and-price algorithm as powerful heuristic to solve subproblems whose dimensions are typically between 25 and 200 customers. whole can be seen application of local search over very large neighborho...

in this paper, we study the multi-depot vehiclerouting problem with inter-depot routes, in which the vehicles can replenish atintermediate depots. vehicles leave the origin depot with load on-board andserve customers until out of load. they may visit an intermediate depot toreplenish and finally return to the origin depot, completing their route. weinitiate a mathematical mixed integer programm...

in this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. proposed model has three-level where the complete network at the top level consists of the central hubs. the second and third levels consist of hub and demand nodes respectively, which are connected through star networks. also, delivery time restriction is taken i...

We consider the node-capacitated routing problem in an undirected ring network along with its fractional relaxation, the node-capacitated multicommodity flow problem. For the feasibility problem, Farkas’ lemma provides a characterization for general undirected graphs asserting roughly that there exists such a flow if and only if the so-called distance inequality holds for every choice of distan...

Capacitated Domination generalizes the classic Dominating Set problem by specifying for each vertex a required demand and an available capacity for covering demand in its closed neighborhood. The objective is to find a minimum-sized set of vertices that can cover all of the graph’s demand without exceeding any of the capacities. In this paper we look specifically at domination with hard-capacit...

We present an adaptation of the active-guided evolution strategies metaheuristic for the capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical problem in operations research in which a set of minimum total cost routes must be determined for a fleet of identical capacitated vehicles in order to service a number of demand or supply points. The applied metaheu...

This paper presents and analyzes a Two-Phase Multi-Swarm Particle Swarm Optimizer (2MPSO) solving the Dynamic Vehicle Routing Problem (DVRP). The research presented in this paper focuses on finding a configuration of several optimization improvement techniques, dedicated to solving dynamic optimization problems, within the 2MPSO framework. Techniques, whose impact on results achieved for DVRP i...