Showing papers in "Computers & Operations Research in 2006"

TL;DR: This survey summary summarizes different modeling and solution concepts of networking games, as well as a number of different applications in telecommunications that make use of or can make useof networking games.

TL;DR: A new variation of PSO model is proposed where a new method of introducing nonlinear variation of inertia weight along with a particle's old velocity is proposed to improve the speed of convergence as well as fine tune the search in the multidimensional space.

TL;DR: In this paper, a mathematical modeling framework that captures many practical aspects of network design problems simultaneously but which have not received adequate attention in the literature has been proposed, including dynamic planning horizon, generic supply chain network structure, external supply of materials, inventory opportunities for goods, distribution of commodities, facility configuration, availability of capital for investments, and storage limitations.

TL;DR: A simple classification scheme is proposed in this paper using weighed linear optimization for inventory classification using ABC analysis and the methodology is illustrated using an example.

TL;DR: A capacitated clustering-based waste collection VRPTW algorithm is developed and Solomon's well-known insertion algorithm is extended for the problem with consideration of multiple disposal trips and drivers' lunch breaks.

TL;DR: This paper develops a tabu search algorithm to solve VRP_SPD, a variant of the classical vehicle routing problem (VRP) where clients require simultaneous pick-up and delivery service.

TL;DR: The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience of various heuristic shortest path algorithms developed in the past.

TL;DR: In the optimization kernel, a combination of linear programming, constraint programming, and (meta-)heuristics for the home health care problem is used, and it is shown how to apply these different heuristics efficiently to solve home health health care problems.

TL;DR: This study suggests two methods for determining the locations of relocated blocks using a branch-and-bound (B&B) algorithm and a decision rule proposed by using an estimator for an expected number of additional relocations for a stack.

TL;DR: It is proved that DEA correctly estimates the true weights when applied to a consistent matrix formed using a known set of weights.

TL;DR: Monte Carlo simulations demonstrate the viability of the genetic algorithm by showing that it consistently and quickly provides good feasible solutions, which makes the real time implementation for high-dimensional problems feasible.

TL;DR: The evolution of the structural properties of the market graph over time is studied and conclusions regarding the dynamics of the stock market development are drawn based on the interpretation of the obtained results.

TL;DR: This article proposes one theoretical and several practical improvements to the algorithm for elementary paths, obtaining better lower bounds and pruning of the search tree and allowing for an exact solution to 17 instances of the Solomon benchmark suite which were previously open.

TL;DR: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows and multiple vehicles (PDPTW) that uses a simple simulated annealing algorithm to decrease the number of routes and Large neighborhood search (LNS) to decrease total travel cost.

TL;DR: This paper proposes to use the gradient information derived from the constraint set to systematically repair infeasible solutions by embedded into a simple GA as a special operator.

TL;DR: Tabucol is a tabu search algorithm that tries to determine whether the vertices of a given graph can be colored with a fixed number k of colors such that no edge has both endpoints with the same color as discussed by the authors.

TL;DR: This paper considers the problem of arranging and rearranging manufacturing facilities such that the sum of the material handling and rearrangement costs is minimized and develops two simulated annealing heuristics for the dynamic facility layout problem.

TL;DR: A variable neighborhood search heuristic for solving mixed-integer programs (MIPs) that uses CPLEX, the general-purpose MIP solver, as a black-box and is able to improve 14 times the best known solution from the set of 29 hard problem instances used to test LB.

TL;DR: A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem and has advantage over other heuristic methods in both solution quality and computation speed.

TL;DR: Two new construction heuristics and a tabu search heuristic are presented for the truck and trailer routing problem, a variant of the vehicle routing problem and Computational results indicate that the heuristic are competitive to the existing approaches.

TL;DR: A transformation technique is applied to map the multidimensional resource consumption to single dimension and convex hulls are constructed to reduce the search space to find the near-optimal solution of the MMKP.

TL;DR: This paper addresses the assembly flowshop scheduling problem with respect to a due date-based performance measure, i.e., maximum lateness, and proposes three heuristics for the problem: particle swarm optimization, Tabu search, and EDD.

TL;DR: The paper shows that this approach can be effective and, in particular, that the original instances may generate node routing instances that behave as if the size is not increased, by slightly modifying the well-known transformation by Pearn, Assad and Golden from capacitated arc routing problem to the capacitated vehicle routing problem (CVRP).

TL;DR: A time-dependent learning effect is proposed and introduced into the single-machine group scheduling problems and two polynomial time algorithms are provided to solve these problems.

TL;DR: A DEA non-linear programming model to evaluate the impact of IT on multiple stages along with information on how to distribute the IT-related resources so that the efficiency is maximized is developed.

TL;DR: A multi-objective genetic algorithm is presented for this more realistic CARP, Inspired by the second version of the Non-dominated sorted genetic algorithm framework, the procedure is improved by using good constructive heuristics to seed the initial population and by including a local search procedure.

TL;DR: A dynamic vehicle routing and scheduling problem with time windows is described where both real-time customer requests and dynamic travel times are considered, and it is shown that some tolerance to deviations with the current planned solution usually leads to better solutions.

TL;DR: In this article, hybrid ant systems (HASs) are developed to solve the dynamic facility layout problem (DFLP), and the results show that the HASs are efficient techniques for solving the DFLP.

TL;DR: A stabilized cutting-plane algorithm within the framework of linear programming for solving the associated Lagrangian dual problem and creates easier constrained shortest path subproblems because less negative cycles are introduced and it leads to faster multiplier convergence due to a stabilization of the dual variables.

TL;DR: This paper presents an extension of the capacitated facility location problem (CFLP), in which the general setup cost functions and multiple facilities in one site are considered and the Lagrangian heuristic algorithm (LHA) is shown to be efficient.