An evolutionary algorithm for interval solid transportation problems

  • Authors:
  • Fernando Jiménez;José L. Verdegay

  • Affiliations:
  • Dept. Informática, Inteligencia Artificial y Electrónica, Universidad de Murcia Campus de Espinardo 30071-Espinardo, Murcia, Spain fernan@dif.um.es;Dept. Ciencias de la Computación e I.A. Universidad de Granada Avda. Andalucía 38 18071-Granada, Spain verdegay@goliat.ugr.es

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Solid Transportation Problem arises when bounds are given on three item properties. Usually, these properties are source, destination and mode of transport (conveyance), and may be given in an interval way. This paper deals with solid transportation problems in which the data in the constraint set are expressed in an interval form, i.e. when sources, destinations and conveyances have interval values instead of point values. An arbitrary linear or nonlinear objective function is also considered. To solve the problem, an Evolutionary Algorithm which extends and generalizes other approaches considering only point values, is proposed.