In this paper we deal with the preemptive asymmetric stackercraneproblem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next...
详细信息
In this paper we deal with the preemptive asymmetric stackercraneproblem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the preemption hypothesis.
In this paper, we deal with the preemptive asymmetric stackercraneproblem in an heuristic way. We first turn this problem into a specific tree design problem. We next derive from this new representation simple, effi...
详细信息
In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information...
详细信息
In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer linear programs for both the unitary and the general versions. We then show that the associated linear relaxations are polynomial-time solvable and present some computational results.
暂无评论