Vehicle Routing Problem (VRP) is a popular combinatorial optimization problem which consists in finding an optimal set of routes for a fleet of vehicles in order to serve a specified collection of clients. Capacitated VRP (CVRP) is a version of VRP in which every vehicle has a capacity parameter assigned. The UCT (Upper Confidence bounds applied to Trees) is a heuristic simulation-based algorit...

This paper presents a new inspired algorithm called Quantum Inspired Cuckoo Search Algorithm (QICSA). This one is new framework relying on Quantum Computing principles and Cuckoo Search algorithm. The contribution consists in defining an appropriate representation scheme in the cuckoo search algorithm that allows applying successfully on combinatorial optimization problems some quantum computin...

The Capacitated Arc Routing Problem with Refill Points (CARP-RP) is a new variant of the Capacitated Arc Routing Problem (CARP). In a CARP situation, the vehicle servicing arcs has a finite capacity, and hence has to return to the depot or a secondary station to be refilled (or emptied). In contrast, in the CARP-RP, the vehicle servicing arcs must be refilled on the spot by using a second vehic...

Ising machines can find optimum or quasi-optimum solutions of combinatorial optimization problems efficiently and effectively. It is known that, when a good initial solution given to an machine, we finally obtain closer the optimal solution. However, several cannot directly accept due its computational nature. In this paper, propose method give quasiinitial into that them. The proposed gives po...

The capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is an extension of the classical Capacitated Vehicle Routing Problem (CVRP). It integrates loading constraints in a routing problem and is based on a real-world transportation problem. The demand of the customers consists of pallets. These pallets may be placed in two horizontal rows inside th...

The multi-level location routing problem (MLLRP) is an extension of the capacitated (CLRP). MLLRPs are considered a class combinatorial optimization problems that arise in transportation applications, such as agricultural logistic planning. Along with concerns regarding environmental harmfulness, recent studies have “green” logistics. This paper addressed low impact model for MLLRP by consideri...

Throughout the history, Genetic Algorithms (GA) have been widely applied to a broad range of combinatorial optimization problems. Its easy applicability to areas such as transport or industry has been one of the reasons for its great success. In this paper, we propose a new Adaptive Multi-Crossover Population Algorithm (AMCPA). This new technique changes the philosophy of the basic genetic algo...

The Capacitated Vehicle Routing Problem is a much-studied (and stronglyNP-hard) combinatorial optimization problem, for which many integer programming formulations have been proposed. We present two new multi-commodity flow (MCF) formulations, and show that they dominate all of the existing ones, in the sense that their continuous relaxations yield stronger lower bounds. Moreover, we show that ...

We consider a special routing problem which has a variety of practical applications. In a graph-theoretic context it is known as the Capacitated Chinese Postman Problem. Given an undirected network in which the demand is located on edges, the goal is to determine a least-cost schedule of routes. The route demands, which must not exceed the vehicle capacity, are serviced by a fleet of vehicles w...

The Open Capacitated Arc Routing Problem OCARP is a well-known NP-hard real-world combinatorial optimization problem. It consists of determining optimal routes for vehicles in given service area at minimal cost distance. main real application the Meter Reader (MRRP). In MRRP problem, each worker electric (or gas) company must visit and read meters to set customers by starting his route from fir...