Journal•ISSN: 0315-5986
Infor
University of Toronto Press
About: Infor is an academic journal published by University of Toronto Press. The journal publishes majorly in the area(s): Queueing theory & Data envelopment analysis. It has an ISSN identifier of 0315-5986. Over the lifetime, 1239 publications have been published receiving 20039 citations. The journal is also known as: Infor (United States).
Topics: Queueing theory, Data envelopment analysis, Decision support system, Integer programming, Computer science
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, the authors investigated the infeasibility of super-efficiency data envelopment analysis (DEA) models in which the unit under evaluation is excluded from the reference set.
Abstract: The paper investigates the infeasibility of super-efficiency data envelopment analysis (DEA) models in which the unit under evaluation is excluded from the reference set. Necessary and sufficient conditions are provided for infeasibility of the super-efficiency DEA measures. By the returns to scale (RTS) classifications obtained from the standard DEA model, we can further locate the position of the unit under evaluation when infeasibility occurs. It is shown that the ranking of the total set of efficient DMUs is impossible because of the infeasibility of super-efficiency DEA models. Also we are able to identify the endpoint positions of the extreme efficient units. The results are useful for sensitivity analysis of efficiency classifications.
418 citations
TL;DR: An efficient generalized permanent labelling algorithm is presented based on the definition of the concept of a generalized bucket and on a specific order of handling the labels to solve the shortest path problem with time windows.
Abstract: The shortest path problem with time windows (SPPTW) consists of finding the least cost route between a source and a sink in a network G = (N, A) while respecting specified time windows [ai, bi] at each visited node The duration dij of each arc is restricted to positive values while the cost Cij of each arc (i, j) Є A is unrestrictedThis article presents an efficient generalized permanent labelling algorithm to solve this problem This new algorithm is based on the definition of the concept of a generalized bucket and on a specific order of handling the labels The algorithm runs in pseudo-polynomial time Problems with up to 2500 nodes and 250,000 arcs have heen solved
369 citations
TL;DR: Two evolution strategies for solving the vehicle routing problem with time windows are proposed and generated new best known solutions indicate that evolution strategies are effective in reducing both the number of vehicles and the total travel distance.
Abstract: The vehicle routing problem with time windows (VRPTW) is an extension of the well-known vehicle routing problem with a central depot. The objective is to design an optimal set of routes that servic...
292 citations
TL;DR: This paper shows how to efficiently transform a GTSP into a standard asymmetric Traveling Salesman Problem (TSP) over the same number of nodes and allows certain routing problems which involve discrete alternatives to be modeled using the TSP framework.
Abstract: The Generalized Traveling Salesman Problem (GTSP) is a useful model for problems involving decisions of selection and sequence. The problem is defined on a directed graph in which the nodes have been pregrouped into m mutually exclusive and exhaustive nodesets. Arcs are defined only between nodes belonging to different nodesets with each arc having an associated cost. The GTSP is the problem of finding a minimum cost m-arc directed cycle which includes exactly one node from each nodeset. In this paper, we show how to efficiently transform a GTSP into a standard asymmetric Traveling Salesman Problem (TSP) over the same number of nodes. The transformation allows certain routing problems which involve discrete alternatives to be modeled using the TSP framework. One such problem is the heterogenous Multiple Traveling Salesman Problem (MTSP) for which we provide a GTSP formulation.
283 citations
TL;DR: Web-HIPRE provides a common platform for individual and group decision making and the most common weighting methods including AHP, SMART, SWING, SMARTER and value functions are supported.
Abstract: Web-HIPRE is a Java applet for multiple criteria decision analysis. Being located on the WWW, it can be accessed from everywhere in the world. This has opened up a completely new era and dimension in decision support. Web-HIPRE provides a common platform for individual and group decision making. The models can be processed at the same or at different times and the results can be easily shared and combined. There is a possibility to define links to other WWW addresses. These links can refer to any other kind of information such as graphics, sound or video describing the criteria or alternatives. This can improve the quality of decision support dramatically. The most common weighting methods including AHP, SMART, SWING, SMARTER and value functions are supported. Web-HIPRE is located on http://www.hipre.hut.fi/
228 citations