Lkketangen Arne

Arne Lkketangen

Information about the author Arne Lkketangen will soon be added to the site.
Found 17 papers in total
A memetic NSGA-II for the bi-objective mixed capacitated general routing problem
A memetic NSGA-II for the bi-objective mixed capacitated general routing problem
2015
The mixed capacitated general routing problem (MCGRP) is concerned with the...
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
A dynamic programming based local search approach for the double traveling salesman problem with multiple stacks
2015
The double traveling salesman problem with multiple stacks consists in determining a...
Generating meta-heuristic optimization code using ADATE
Generating meta-heuristic optimization code using ADATE
2010
Local Search based meta-heuristic methods for finding good solutions to hard...
A metaheuristic for stochastic service network design
A metaheuristic for stochastic service network design
2010
This paper considers the time-dependent service network design problem with stochastic...
Using scenario trees and progressive hedging for stochastic inventory routing problems
Using scenario trees and progressive hedging for stochastic inventory routing problems
2009
The Stochastic Inventory Routing Problem is a challenging problem, combining inventory...
Experiments concerning sequential versus simultaneous maximization of objective function and distance
Experiments concerning sequential versus simultaneous maximization of objective function and distance
2008
Suppose two solution vectors are needed that have good objective function values and...
Integrating pivot based search with branch and bound for binary MIPs
Integrating pivot based search with branch and bound for binary MIPs
2000
The paper examines integration of a sophisticated pivot-based tabu search technique...
Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search
Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search
2006
We consider the Traveling Salesman Problem with Pickup and Delivery (TSPPD) where the...
Adaptive memory search for multidemand multidimensional knapsack problems
Adaptive memory search for multidemand multidimensional knapsack problems
2006
We describe a simple adaptive memory search method for the 0/1 Multidemand...
Arc routing in a node routing environment
Arc routing in a node routing environment
2006
We describe a special variant of the vehicle routing problem (VRP), where there are...
A distance function to support optimized selection decisions
A distance function to support optimized selection decisions
2005
Decision-makers often want to see a diverse collection of good solutions in addition...
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
2001
In a great many situations, the data for optimization problems cannot be known with...
Interactive planning for sustainable forest management
Interactive planning for sustainable forest management
2000
The long-term planning of sustainable forest treatment at the landscape level is an...
Tabu search for weighted k-cardinality trees
Tabu search for weighted k-cardinality trees
1997
We consider the minimum weighted k -cardinality tree problem, i.e. the problem of...
Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming
Progressive hedging and tabu search applied to mixed integer (0, 1) multistage stochastic programming
1996
Many problems faced by decision makers are characterized by a multistage decision...
Solving zero–one mixed integer programming problems using tabu search
Solving zero–one mixed integer programming problems using tabu search
1998
We describe a tabu search (TS) approach for solving general zero–one mixed...
Tabu Search for zero-one mixed integer programming with advanced level strategies and learning
Tabu Search for zero-one mixed integer programming with advanced level strategies and learning
1995
The authors show how carefully designed Tabu Search mechanisms can work together...
Papers per page: