Top 

About: Top is an academic journal published by Springer Science+Business Media. The journal publishes majorly in the area(s): Computer science & Optimization problem. It has an ISSN identifier of 1134-5764. Over the lifetime, 819 publications have been published receiving 11403 citations. The journal is also known as: spinning top & spintop.

Static pickup and delivery problems: a classification scheme and survey

Abstract: Pickup and delivery problems constitute an important class of vehicle routing problems in which objects or people have to be collected and distributed. This paper introduces a general framework to model a large collection of pickup and delivery problems, as well as a three-field classification scheme for these problems. It surveys the methods used for solving them.

Routing problems with loading constraints

Abstract: We consider difficult combinatorial optimization problems arising in transportation logistics when one is interested in optimizing both the routing of vehicles and the loading of goods into them. The separate problems (routing and loading) are already \(\mathcal{NP}\)-hard, and very difficult to solve in practice. A fortiori their combination is extremely challenging and stimulating. Although the specific literature is still quite limited, a first attempt to a systematic view of this field can be useful both to academic researchers and to practitioners. We review vehicle routing problems with two- and three-dimensional loading constraints. Other combinations of routing and special loading constraints arising from industrial applications are also considered.

Operations Research Games: a Survey

Abstract: This paper surveys the research area of cooperative games associated with several types of operations research problems in which various decision makers (players) are involved. Cooperating players not only face a joint optimisation problem in trying, e.g., to minimise total joint costs, but also face an additional allocation problem in how to distribute these joint costs back to the individual players. This interplay between optimisation and allocation is the main subject of the area of operations research games. It is surveyed on the basis of a distinction between the nature of the underlying optimisation problem: connection, routing, scheduling, production and inventory.

Approximative solution methods for multiobjective combinatorial optimization

Abstract: In this paper we present a review of approximative solution methods, that is, heuristics and metaheuristics designed for the solution of multiobjective combinatorial optimization problems (MOCO). First, we discuss questions related to approximation in this context, such as performance ratios, bounds, and quality measures. We give some examples of heuristics proposed for the solution of MOCO problems. The main part of the paper covers metaheuristics and more precisely non-evolutionary methods. The pioneering methods and their derivatives are described in a unified way. We provide an algorithmic presentation of each of the methods together with examples of applications, extensions, and a bibliographic note. Finally, we outline trends in this area.