TITLE

Selected Abstracts for the 1989 Transportation Science Section Dissertation Prize Competition

AUTHOR(S)
Powell, Warren B.
PUB. DATE
November 1990
SOURCE
Transportation Science;Nov90, Vol. 24 Issue 4, p298
SOURCE TYPE
Academic Journal
DOC. TYPE
Abstract
ABSTRACT
The section presents abstracts of several dissertations in transportation science. Probabilistic Combinatorial Optimization Problems by Dimitris J. Bertsimas. An Optimization Based Heuristic for Vehicle Routing and Scheduling With Time Window Constraints by Yiannis A. Koskosidis. Local Search Algorithms for Vehicle Routing and Other Combinatorial Problems by Paul M. Thompson. Time Dependent Vehicle Routing Problems: Formulations, Solution Algorithms and Computational Experiments by Chryssi Malandraki. A Network-Based Primal-Dual Solution Methodology for the Multi-Commodity Network Flow Problem by Cynthia Barnhart.
ACCESSION #
4458463

 

Related Articles

  • CYCLE-BASED NEIGHBOURHOODS FOR FIXED-CHARGE CAPACITATED MULTICOMMODITY NETWORK DESIGN. Ghamlouche, Ilfat; Crainic, Teodor Gabriel; Gendreau, Michel // Operations Research;Jul/Aug2003, Vol. 51 Issue 4, p655 

    We propose new cycle-based neighbourhood structures for metaheuristics aimed at the fixed-charge capacitated multicommodity network design formulation. The neighbourhood defines moves that explicitly take into account the impact on the total design cost of potential modifications to the flow...

  • A Request Clustering Algorithm for Door-to-Door Handicapped Transportation. Ioachim, Irina; Desrosiers, Jacques; Dumas, Yvan; Solomon, Marius M.; Villeneuve, Daniel // Transportation Science;Feb95, Vol. 29 Issue 1, p63 

    This paper examines whether there is a substantial additional payoff to be derived from using mathematical optimization techniques to globally define a set of mini-clusters. Specifically, we present a new approximate method to mini-clustering that involves solving a multi-vehicle pick-up and...

  • Network Optimization with Continuous Control Parameters. Marcotte, Patrice // Transportation Science;May83, Vol. 17 Issue 2, p181 

    In this paper we consider two network optimization problems which have the following characteristics: control parameters vary continuously and network users behave according to War-drop's first principle of traffic equilibrium ("user-optimization"). For each problem, we study an exact algorithm...

  • URBAN TRANSPORT NETWORK OPTIMIZATION BY TRAVELING PUBLIC IN ALGORITHM PERSPECTIVE. MĂRGINEAN, Nicolae // Quality - Access to Success;2011 Supplement, p756 

    Traffic management problem in large cities of the world raises a strong interest from local communities. A basic component of today's urban traffic is also the urban passenger transport. Autonomous urban transport administrations are an important factor in urban pollution. Using means of...

  • The Multi-commodity Capacitated Multi-facility Weber Problem: Heuristics and Confidence Intervals. Akyüz, M. Hakan; Öncan, Temel; Altınel, İ. Kuban // International MultiConference of Engineers & Computer Scientists;2009, p2042 

    The Capacitated Multi-facility Weber Problem is concerned with locating I capacitated facilities in the plane to satisfy the demand of J customers with the minimum total transportation cost of a single commodity. This is a non-convex optimization problem and difficult to solve. In this work, we...

  • METAHEURISTICS AND LARGE-SCALE OPTIMIZATION. Sakalauskas, Leonidas // Technological & Economic Development of Economy;2006, Vol. 12 Issue 1, p3 

    Reports on the 5th EU/ME Workshop with the theme "Metaheuristics and Large Scale Optimization," held in Vilnius, Lithuania. Topics of the workshop; Countries that participated in the event; Speakers.

  • Portfolio Optimization, Heuristics and The 'Butterfly Effect'. Nawrocki, David N. // Journal of Financial Planning;Feb2000, Vol. 13 Issue 2, p68 

    According to the author of this article, a phenomenon called the "butterfly effect" applies to portfolio optimizers just as much as it does to the global weather system. In this article, he discusses the drawbacks of portfolio optimizers and presents heuristic algorithms as a possible solution.

  • Max Min Ant System and Capacitated p-Medians: Extensions and Improved Solutions. De França, Fabrício Olivetti; Von Zuben, Fernando J.; de Castro, Leandro Nunes // Informatica (03505596);Jun2005, Vol. 29 Issue 2, p163 

    This work introduces a modified MAX MIN Ant System (MMAS) designed to solve the Capacitated p-Medians Problem (CPMP). It presents the most relevant steps towards the implementation of an MMAS to solve the CPMP, including some improvements on the original MMAS algorithm, such as the use of a...

  • Application of Shuffled Frog Leaping Algorithm to Long Term Generation Expansion Planning. Jadidoleslam, M.; Bijami, E.; Amiri, N.; Ebrahimi, A.; Askari, J. // International Journal of Computer & Electrical Engineering;Apr2012, Vol. 4 Issue 2, p115 

    This paper presents the application of an efficient shuffled frog leaping algorithm (SFLA) to solve the optimal generation expansion planning (GEP) problem. The SFLA is a meta-heuristic search method inspired by natural memetics. It combines the advantages of both genetic-based memetic...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics