Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Optimal location of routes for vehicles transporting hazardous materials

Article Abstract:

The problem of optimizing the routes for transporting hazardous substances to minimize pollution and injuries to people is explored. Specifically, a fixed-route model which characterizes the problem such that meteorological conditions determine the emission of contaminants in the event of an accident is proposed. From this, a branch and bound procedure is developed to locate the optimal routes given that the origin and destination sites are fixed.

Author: Boffey, T.B., Karkazis, J.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Transportation, Hazardous substances, Branch and bound algorithms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Optimal positioning of new product-concepts: some analytical implications and empirical results

Article Abstract:

A discussion of identifying specific locations for optimal new product-concept positioning in the perceptual product-attribute space centers on the efficient definition of discontinuous innovations. Results show that deriving accurate analytical expressions is intractable with at least three segments. Therefore, different approximations are used to identify the location of optimal new product-concept positioning.

Author: Eliashberg, Jehoshua, Manrai, Ajay K.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
New products, Product introduction

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


A multicriteria Pareto-optimal path algorithm

Article Abstract:

A proposed efficient algorithm for deriving the complete set of efficient paths such as Pareto-optimal paths whihc are derived from a preassigned source node to a preassigned terminal node in a network. The complete set is obtained by collecting one efficient path per efficient objective vector since one of the latter may correspond to multiple and distinct efficient paths.

Author: Chi Tung Tung, Kim Lin Chew
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1992
Computer networks, Graph theory

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Mathematical optimization, Optimization theory
Similar abstracts:
  • Abstracts: A practical heuristic for a large scale vehicle routing problem. Postoptimizing equilibrium flows on large scale networks
  • Abstracts: Guilt by association. Arguments for enlargement
  • Abstracts: Can Obasanjo save Nigeria. Voting against the odds: Nigeria. Unnecessary trip: Nigeria
  • Abstracts: RFAC urges Olympic contest. A modern airport squeezed into a restricted linear site
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.