A significantly under-explored area of evolutionary optimization in the literature is the study of optimization methodologies that can evolve along with the problems solved. Particularly, present evolutionary optimization approaches generally start their search from scratch or the ground-zero state of knowledge, independent of how similar the given new problem of interest is to those optimized ...

The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve ...

Extensive research has been conducted, over recent years, on various ways of enhancing heuristic search for combinatorial optimization problems with machine learning algorithms. In this study, we investigate the use predictions from graph neural networks (GNNs) in form heatmaps to improve Hybrid Genetic Search (HGS), a state-of-the-art algorithm Capacitated Vehicle Routing Problem (CVRP). The c...

The split-delivery vehicle routing problem (SDVRP) is a natural extension of the classical vehicle routing problem (VRP) that allows the same customer to be served by more than one vehicle. This problem is a very challenging combinatorial optimization problem and has attracted much academic attention. To solve it, most of the literature articles adopted heuristic approaches in which the solutio...

In this article, particle swarm optimization (PSO) is adopted to solve capacitated vehicle routing problems (CVRPs). In order to obtain high quality and diverse initial solutions to facilitate the subsequent search for optimal solutions by PSO, a sweep algorithm is combined with greedy randomized adaptive search procedure (GRASP) to produce high quality initial solutions, and an initial heurist...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...

Large-sized extended formulations have the potential for providing high-quality bounds on some combinatorial optimization problems where the natural formulations perform poorly. This chapter discusses the use of some families of cuts that have been recently applied on extended formulations that are obtained by the discretization of the continuous variables occurring in the natural formulation o...

This paper introduces a new self-tuning mechanism to the local search heuristic for solving of combinatorial optimization problems. Parameter tuning of heuristics makes them difficult to apply, as parameter tuning itself is an optimization problem. For this purpose, a modified local search algorithm free from parameter tuning, called SelfAdaptive Local Search (SALS), is proposed for obtaining q...

We use a branch-and-cut search to solve the Whizzkids’96 vehicle routing problem, demonstrating that the winning solution in the 1996 competition is in fact optimal. Our algorithmic framework combines the LP-based traveling salesman code of Applegate, Bixby, Chvátal, and Cook, with specialized cutting planes and a distributed search algorithm, permitting the use of a computing network located a...