TITLE

In This Issue

PUB. DATE
November 1995
SOURCE
Transportation Science;Nov95, Vol. 29 Issue 4, p303
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The article presents information about various works published in January 11, 1995 issue of the journal "Transportation Science." The article "Dynamic Processes and Equilibrium in Transportation Networks: Towards a Unifying Theory," describes a more general modeling approach based on deterministic and/or stochastic dynamic processes. The described framework is used to investigate coincidence of fixed-point attractors of a deterministic process model and equilibrium states, existence and uniqueness of fixed-point attractors, stability of both fixed-points and equilibrium. The article "The Intermodal Trailer Assignment Problem" offers a novel modeling approach to this intermodal trailer assignment problem. The problem is cast in the form of a set covering problem with side constraints. Two methods of resolving the resulting formulation are studied. One is a traditional branch and bound procedure, and the second is a heuristic method observed to perform very well in practice.
ACCESSION #
4454329

 

Related Articles

  • CAPACITATED VEHICLE ROUTING ON TREES. Labbé, Martine; Laporte, Gilbert; Mercure, Héléne // Operations Research;Jul/Aug91, Vol. 39 Issue 4, p616 

    T = (V, E) is a tree with nonnegative weights associated with each of its vertices. A fleet of vehicles of capacity Q is located at the depot represented by vertex v[sub 1]. The Capacitated Vehicle Routing Problem on Trees (TCVRP) consists of determining vehicle collection routes starting and...

  • A greedy randomized adaptive search procedure for maximum independent set. Feo, Thomas A.; Resende, Mauricio G. C. // Operations Research;Sep/Oct94, Vol. 42 Issue 5, p860 

    An efficient randomized heuristic for a maximum independent set is presented. The procedure is tested on randomly generated graphs having from 400 to 3,500 vertices and edge probabilities from 0.2 to 0.9. The heuristic can be implemented trivially in parallel and is tested on an MIMD computer...

  • ICT Capstone projects: 'the edge of chaos'. Chard, Sue; Lloyd, Brenda; Tongariro, George // New Zealand Journal of Applied Computing & Information Technolog;2010, Vol. 14 Issue 1, p2 

    Capstone project processes and assessment methodologies continue to be problematic. Experience has led us to review our assessment rubrics and methods with every iteration in an attempt to refine and improve the practice and outcomes. This review has surveyed a broad range of capstone projects...

  • CANCEL AND RETHINK IN THE WASON SELECTION TASK: FURTHER EVIDENCE FOR THE HEURISTIC-ANALYTIC DUAL PROCESS THEORY. Wada, Kazushige; Nittono, Hiroshi // Perceptual & Motor Skills;Jun2004 Part 2, Vol. 98 Issue 3, p1315 

    The reasoning process in the Wason selection task was examined by measuring card inspection times in the letter-number and drinking-age problems. 24 students were asked to solve the problems presented on a computer screen. Only the card touched with a mouse pointer was visible, and the total...

  • Heuristic identification of critical nodes in sparse real-world graphs. Pullan, Wayne // Journal of Heuristics;Oct2015, Vol. 21 Issue 5, p577 

    Given a graph, the critical node detection problem can be broadly defined as identifying the minimum subset of nodes such that, if these nodes were removed, some metric of graph connectivity is minimised. In this paper, two variants of the critical node detection problem are addressed. Firstly,...

  • Tracer Advection Using Dynamic Grid Adaptation and MM5. Iselin, John P.; Gutowski, William J.; Prusa, Joseph M. // Monthly Weather Review;Jan2005, Vol. 133 Issue 1, p175 

    A dynamic grid adaptation (DGA) technique is used to numerically simulate tracer transport at meso- and regional scales. A gridpoint redistribution scheme is designed to maximize heuristic characteristics of a “good” grid. The advective solver used in conjunction with the DGA is the...

  • Part selection and tool allocation in discrete parts manufacturing. Iakovou, Eleftherios; Koulamas, Christos; Malik, Kavindra // Annals of Operations Research;1998, Vol. 76 Issue 1-4, p187 

    A recurrent problem in discrete parts manufacturing is to select the optimal mix of parts and to allocate the necessary tools on a machine's carousel in order to maximize net profit. We formulate the problem as an integer program and compute an upper bound for the optimal solution. We then...

  • TABU SEARCH. Glover, Fred // Encyclopedia of Operations Research & Management Science;2001, p821 

    A definition of the term "tabu search" is presented. It is defined as a metaheuristic guiding local heuristic search procedure to explore the solution space beyond local optimality. It is based on the premise that problem solving must incorporate adaptive memory and responsive exploration...

  • The Multiple Terminal Delivery Problem with Probabilistic Demands. Tillman, Frank A. // Transportation Science;Aug69, Vol. 3 Issue 3, p192 

    A heuristic approach is presented for solving the multiterminal delivery problem with constraints on the system and probabilistic demands. The algorithm is basically the same whether a commodity is being collected or delivered. This is a practical method that results in 'near optimal' solutions...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

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

Try another library?
Sign out of this library

Other Topics