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...

Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing problems (VRP), for which exact solution methods impractical. In particular, local search-based metaheuristics have been successfully applied the capacitated VRP (CVRP). The CVRP aims at defining minimum-cost delivery routes a given set of identical vehicles since each only travels one route and there i...

The Vehicle Routing Problem (VRP) deals with the assignment of a set of transportation orders to a fleet of vehicles, and the sequencing of stops for each vehicle to minimize transportation costs. In this paper we study the Capacitated VRP (CVRP), which is mainly characterized by using vehicles of the same capacity. Taking a basic GA to solve the CVRP, we propose a new problem dependent recombi...

Recent years, spatial data and observed data, such as digital road map, traffic route, vehicle speed, recordings events and others, are integrated and stored into the spatial temporal database systems. Various location-based services by using mobile phone are also becoming popular. In this paper, we focus on one of GIS-based scheduling applications concerning the availability of GPS technologie...

Ant colony optimization (ACO) algorithms are population-based algorithms where ants communicate via their pheromone trails. Usually, this indirect communication leads the algorithm to a stagnation behaviour, where the ants follow the same path from early stages. This is because high levels of pheromone are generated into a single trail, where all the ants are influenced and follow it. As a resu...

Combinatorial optimization problems on graphs arise in many practical applications. One of the most studied practical combinatorial optimization problem is the Vehicle Routing Problem (VRP). When coupled with modern in-car navigation and fleet management software, real world applications of VRP optimization result in significant cost savings. In this paper novel multiple improvements pivoting r...

The energy consumption of vehicles in urban distribution is worthy of attention for both low-carbon logistics and deduction of distribution cost. The classical models of logistics distribution generally focused on minimizing the distance covered by vehicles and paid little attention to the properties of urban distribution. This paper presents a model of urban vehicle routing problem with the ob...

The Capacitated Vehicle Routing Problem (CVRP) is one of the most popular routing problems. In the CVRP, a fleet of capacitated vehicles located at a central depot are used to deliver products to a set of geographically dispersed customers with known demand. In this work, a new two-step approach to solve the CVRP with a heterogeneous fleet is proposed. In the first step; a balanced K-means clus...

Vehicle routing is one of the crucial logistic activities for delivering goods or services. This paper demonstrates the application of the clonal selection of Artificial Immune System (AIS), Generalized Evolutionary Walk Algorithm (GEWA) and Genetic Algorithm (GA) for solving capacitated vehicle routing problem (CVRP). The optimal parameter settings of the proposed algorithms were investigated ...

Distribution of goods is of importance in logistics and supply chain management. The target of a distribution network is to specify the beneficial way for delivering goods and commodities from supply to demand points. In distribution domain, this activity can usually be viewed as a capacitated vehicle routing problem (CVRP). As the CVRP solutions remain computationally intractable, we develop i...