Skip to search formSkip to main contentSkip to account menu
A Survey of the Maximum Principles for Optimal Control Problems with State Constraints
TLDR
The relations between the different sets of optimality conditions arising in Pontryagin's maximum principle are shown and the application of these maximum principle conditions is demonstrated by solving some illustrative examples.
View on SSRN
A NEW RANK BASED VERSION OF THE ANT SYSTEM: A COMPUTATIONAL STUDY
TLDR
It turns out that the new rank based ant system can compete with the other methods in terms of average behavior, and shows even better worst case behavior.
A survey on pickup and delivery problems
TLDR
Single as well as multi vehicle mathematical problem formulations for all three VRPPD types are given, and the respective exact, heuristic, and metaheuristic solution methods are discussed.
View on Springer
An improved Ant System algorithm for theVehicle Routing Problem
TLDR
An improved ant system algorithm for the Vehicle RoutingProblem with one central depot and identical vehicles is presented and a comparison with five other metaheuristic approaches for solving Vehicle Routed Problems is given.
View on Springer
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
TLDR
Pareto Ant Colony Optimization is introduced as an especially effective meta-heuristic for solving the portfolio selection problem and its performance is compared to other heuristic approaches (i.e., Pareto Simulated Annealing and the Non-Dominated Sorting Genetic Algorithm) by means of computational experiments with random instances.
View on Springer
Applying the ANT System to the Vehicle Routing Problem
TLDR
A recently proposed metaheuristic, the Ant System, is used to solve the Vehicle Routing Problem in its basic form, i.e., with capacity and distance restrictions, one central depot and identical vehicles.
View via Publisher
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
View via Publisher
A variable neighborhood search heuristic for periodic routing problems
View via Publisher
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem
View via Publisher
Heuristics for the multi-period orienteering problem with multiple time windows
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License