Hybrid Meta-Heuristic Approaches for Vehicle Routing Problem with Fuzzy Demands

2010 ◽  
Vol 439-440 ◽  
pp. 241-246
Author(s):  
Chang Shi Liu ◽  
Shu Jin Zhu
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Credibility Measure ◽  
Computational Results ◽  
Routing Problem ◽  
High Effectiveness ◽  
Heuristic Approaches ◽  
And Performance ◽  
Vehicle Routes

The vehicle routing problem with fuzzy demands at nodes is considered. The fuzzy credibility measure is developed to determine the credibility to send the vehicle to next node, and a hybrid mata-heuristics is proposed to determine a set of vehicle routes to minimizes vehicle number and total costs. Finally the computational results are presented to show the high effectiveness and performance of the proposed approaches.

A Two-Stage Hybrid Heuristic for Vehicle Routing Problem with Fuzzy Demands

2011 ◽  
Vol 460-461 ◽  
pp. 710-715 ◽  
Author(s):  
Chang Shi Liu ◽  
Fu Hua Huang
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Credibility Measure ◽  
Computational Results ◽  
Two Stage ◽  
Routing Problem ◽  
Hybrid Heuristic ◽  
Second Stage ◽  
Hybrid Heuristics ◽  
And Performance

A two-stage hybrid heuristic is presented for vehicle routing problem with fuzzy demands in this paper, the fuzzy credibility measure is employed to determine the credibility to send the vehicle to next node in the first stage, and a hybrid heuristics is proposed to determine a set of vehicle routes to minimize total costs in the second stage, especially for the additional distance and additional loading times. Finally the computational results are presented to show the high effectiveness and performance of the proposed approaches.

scholarly journals VEHICLE ROUTING PROBLEM WITH TIME WINDOWS USING HYBRID ENCODING GENETIC ALGORITHM

2014 ◽  
Vol 12 (10) ◽  
pp. 3945-3951
Author(s):  
Dr P.K Chenniappan ◽  
Mrs.S.Aruna Devi
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Window ◽  
Time Windows ◽  
Minimal Cost ◽  
Total Size ◽  
Routing Problem ◽  
Time Window Constraints ◽  
Vehicle Capacity ◽  
Vehicle Routes

The vehicle routing problem is to determine K vehicle routes, where a route is a tour that begins at the depot, traverses a subset of the customers in a specified sequence and returns to the depot. Each customer must be assigned to exactly one of the K vehicle routes and total size of deliveries for customers assigned to each vehicle must not exceed the vehicle capacity. The routes should be chosen to minimize total travel cost. Thispapergivesasolutiontofindanoptimumrouteforvehicle routingproblem using Hybrid Encoding GeneticAlgorithm (HEGA)technique tested on c++ programming.The objective is to find routes for the vehicles to service all the customers at a minimal cost and time without violating the capacity, travel time constraints and time window constraints

Fuzzy Based Parameter Adaptation in ACO for Solving VRP

2019 ◽  
Vol 10 (2) ◽  
pp. 65-81 ◽  
Author(s):  
Sandhya ◽  
Rajiv Goel
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Control Mechanism ◽  
Optimization Problems ◽  
Adaptive Strategies ◽  
Benchmark Problems ◽  
Parameter Control ◽  
Computational Results ◽  
Parameter Adaptation ◽  
Routing Problem

Ant Colony Optimization, a popular class of metaheuristics, have been widely applied for solving optimization problems like Vehicle Routing Problem. The performance of ACO is affected by the values of parameters used. However, in literature, few methods are proposed for parameter adaptation of ACO. In this article, a fuzzy-based parameter control mechanism for ACO has been developed. Three adaptive strategies FACO-1, FACO-2, FACO-3 are proposed for determining values of parameters alpha and beta, and evaporation factor separately as well as for all three parameters simultaneously. The performance of proposed strategies is compared with standard ACS on TSP and VRP benchmarks. Computational results on standard benchmark problems shows the effectiveness of the strategies.

Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

2007 ◽  
Vol 41 (4) ◽  
pp. 516-526 ◽  
Author(s):  
Mauro Dell'Amico ◽  
Michele Monaci ◽  
Corrado Pagani ◽  
Daniele Vigo
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Routing Problem ◽  
Fleet Size ◽  
Heuristic Approaches ◽  
Fleet Size And Mix

An Effective Genetic Algorithm for the Vehicle Routing Problem with Multiple Depots

2011 ◽  
Vol 204-210 ◽  
pp. 283-287 ◽  
Author(s):  
Yun Yao Li ◽  
Chang Shi Liu
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Computing Time ◽  
Travel Distance ◽  
Computational Results ◽  
High Quality ◽  
Routing Problem ◽  
Multiple Depots ◽  
Reasonable Computing

The vehicle routing problem with multiple depots was considered in this paper, and a genetic algorithm for the proposed problem was designed to minimize the vehicle number and total travel distance. Performances are compared with other heuristics recently published in the literature, the computational results show that the proposed approaches produce high quality results within a reasonable computing time.

Sign in / Sign up

Export Citation Format

Share Document