A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Journal of Heuristics
Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem
Transportation Science
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
Applied Intelligence
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
Sequential search and its application to vehicle-routing problems
Computers and Operations Research
Waste collection vehicle routing problem with time windows
Computers and Operations Research
A hybrid genetic algorithm for the capacitated vehicle routing problem
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Journal of Mathematical Modelling and Algorithms
The Journal of Supercomputing
A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows
Computers and Industrial Engineering
An ant colony algorithm for the multi-compartment vehicle routing problem
Applied Soft Computing
Computers and Operations Research
A bi-objective vehicle routing problem with time windows: A real case in Tenerife
Applied Soft Computing
Hi-index | 0.00 |
This paper presents a new model and solution for multi-objective vehicle routing problem with time windows (VRPTW) using goal programming and genetic algorithm that in which decision maker specifies optimistic aspiration levels to the objectives and deviations from those aspirations are minimized. VRPTW involves the routing of a set of vehicles with limited capacity from a central depot to a set of geographically dispersed customers with known demands and predefined time windows. This paper uses a direct interpretation of the VRPTW as a multi-objective problem where both the total required fleet size and total traveling distance are minimized while capacity and time windows constraints are secured. The present work aims at using a goal programming approach for the formulation of the problem and an adapted efficient genetic algorithm to solve it. In the genetic algorithm various heuristics incorporate local exploitation in the evolutionary search and the concept of Pareto optimality for the multi-objective optimization. Moreover part of initial population is initialized randomly and part is initialized using Push Forward Insertion Heuristic and @l-interchange mechanism. The algorithm is applied to solve the benchmark Solomon's 56 VRPTW 100-customer instances. Results show that the suggested approach is quiet effective, as it provides solutions that are competitive with the best known in the literature.