• Corpus ID: 53594388

Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm

@inproceedings{Nasir2011EvaluationOV,
  title={Evaluation of vehicle routing problem with time windows by using metaheuristics algorithm},
  author={Abdul Nasir and Suraya Masrom and Norlee Husnafeza Ahmad},
  year={2011}
}
Vehicle routing problem with Time Window (VRPTW) has received much attention by researchers in solving many scheduling applications for transportation and logistics. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with various demands and time window constraints. As a non-polynomial (NP) hard problem, the VRPTW is complex and time consuming, especially when it involves a large number of customers and constraints. This paper presents a… 

Figures and Tables from this paper

Relative Performance of Certain Meta Heuristics on Vehicle Routing Problem with Time Windows
Solving Vehicle Routing Problem (VRP) and its variants arise in many real life distribution systems. Classical VRP can be described as the problem of finding minimum cost routes with identical
An Enhanced Ant Colony Optimization Algorithm for Vehicle Routing Problem with Time Windows
  • Ashima Gupta, S. Saini
  • Computer Science
    2017 Ninth International Conference on Advanced Computing (ICoAC)
  • 2017
TLDR
An improved ant colony optimization (ACO) is applied to the problem, which uses a new pheromone reset and update function to enhance the route searching and a 2-opt method to improve the optimized path.
A Multi-Strategy Elite Ant System Algorithm for Vehicle Routing Problem with Time Window
TLDR
A multi-strategy elite ant system algorithm is proposed to improve the optimization performance of solving VRPTW and mutation strategy including the mutation for the colony and the mutations for the optimal ant is proposed for improving the local search capability.

References

SHOWING 1-10 OF 19 REFERENCES
Hybrid particle swarm optimization for vehicle routing problem with time windows
Vehicle routing problem with Time Window (VRPTW) has received much attention by researchers in solving many scheduling applications for transportation and logistics. The objective of VRPTW is to use
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
TLDR
A real-value version of particle swarm optimization (PSO) algorithm for solving the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) and the mechanism of the PSO for solving VRPSPD is explained and demonstrated.
Hybrid Particle Swarm Algorithm for Grain Logistics Vehicle Routing Problem
  • Yuhua Zhu, Hongyi Ge, T. Zhen
  • Computer Science
    2009 Third International Symposium on Intelligent Information Technology Application
  • 2009
TLDR
Aiming at the characteristics of the large batch and multi-point to multi- point transportation of grain logistics, a hybrid particle swarm optimization (PSO) with simulated annealing (SA) algorithm is proposed to solve grain logistics VRPTM in this paper.
Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem
TLDR
This paper presents two solution representations and the corresponding decoding methods for solving the capacitated vehicle routing problem (CVRP) using particle swarm optimization (PSO) and shows that representationSR-2 is better than representation SR-1 and also competitive with other methods for solve CVRP.
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Given a set of timetabled tasks, the multi-depot vehicle scheduling problem consists of determining least-cost schedules for vehicles assigned to several depots such that each task is accomplished
A particle swarm optimization for the capacitated vehicle routing problem
This paper proposed a random-key based solution representaion and decoding metdod for solving the Capacitated Vehicle Routing Problem (CVRP) using Particle Swarm Optimization (PSO). The Solution CVRP
Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high
A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves
TLDR
The experimental results suggest that the proposed Genetic Algorithm based on a specially tailored tour improvement procedure for the TSPPD yields a promising performance in terms of both accuracy and efficiency compared to existing algorithms in the literature.
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
  • M. Solomon
  • Mathematics, Computer Science
    Oper. Res.
  • 1987
TLDR
This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Fuzzy discrete particle swarm optimization for solving traveling salesman problem
TLDR
A modified particle swarm optimization (PSO) algorithm was proposed to solve a typical combinatorial optimization problem: traveling salesman problem (TSP), which is a well-known NP-hard problem.
...
1
2
...