Abstract

Abstract
Ranking problems arise from the knowledge of several binary relations defined on a set of alternatives, which we intend to rank. In a previous work, the authors introduced a tool to confirm the solutions of multi-attribute ranking problems as linear extensions of a weighted sum of preference relations. An extension of this technique allows the recognition of critical preference pairs of alternatives, which are often caused by inconsistencies. Herein, a confirmation procedure is introduced and applied to confirm the results obtained by a multi-attribute decision methodology on a tender for the supply of buses to the Porto Public Transport Operator.

Abstract
A large variety of techniques have been developed to solve or approximate the solution of multiattribute ranking problems. From such techniques, several implicit or explicit partial orders, defined on the same set of alternatives, are obtained (in many cases, by pairwise comparisons) with the goal of determining a linear order. Often, this goal is attained by assigning positive weights to each partial order relation. However, the imprecise judgments of the pairwise comparisons as well as other factors lead to inconsistencies which have been analyzed in an extensive literature devoted to this type of problem. In this paper, numerical results about linear extensions of weighted sum relations are applied to the recognition of pairwise imprecise judgments between alternatives as well as to the confirmation of a ranking solution as a linear extension of a quasi-order defined by a weighted sum of binary preference relations. (C) 2003 Wiley Periodicals, Inc.

Abstract
The author describes a man-computer interactive mass transit crew scheduling module which was developed as a component of a Decision Support System (DSS) implemented in a personal computer at the Oporto Urban Transport Authority (STCP). The problem of crew scheduling is briefly discussed and set in the context of the broader process of the planning and control of urban transport services. The general philosophy and the structure of the module are analysed. A crew scheduling heuristic based method is presented. Particular attention is paid to the interactive nature of the approach adopted. Results of the actual implementation process at STCP are given.

Abstract
The territory alignment problem is part of a bigger procedure, the territory design, which consists of assigning small geographic regions to larger areas following the most relevant criteria for planning. This chapter aims to briefly update the review of the existing literature on the territory alignment problem, its applications and solution approaches, and to illustrate the most recent tendencies by means of a hybrid meta-heuristic developed by the authors. The approach is based in GRASP and Tabu Search meta-heuristics. The algorithm was integrated in an interactive and user-friendly Geographic Information System application, named MultiACE, also developed in the context of this study. This application was embedded in the ArcGIS software. This chapter also illustrates the potential of the proposed approach as a practical and readily implementable management decision aid in the context of a current case that involved the maintenance team of a Portuguese regional office of a worldwide equipment company. © 2012, IGI Global.

Abstract
The author describes a man-computer interactive mass transit crew scheduling module which was developed as a component of a Decision Support System (DSS) implemented in a personal computer at the Oporto Urban Transport Authority (STCP). The problem of crew scheduling is briefly discussed and set in the context of the broader process of the planning and control of urban transport services. The general philosophy and the structure of the module are analysed. A crew scheduling heuristic based method is presented. Particular attention is paid to the interactive nature of the approach adopted. Results of the actual implementation process at STCP are given. © 1991.