A genetic algorithm for the linear transportation problem

Vignaux, Georges; Michalewicz, Zbigniew

doi:10.1109/21.87092

Cited by 201 publications

(59 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this experimental design, the performance of the procedure is evaluated by the solution quality. The genetic algorithm with matrix code (GA-M) developed by Vignaux et al [10] and the genetic algorithm with edge-set code (GA-ES) proposed by Raidl et al [12] are selected as references against which to gauge the performance of IGA. GA-M is selected because GA-M is the high efficient GA for FCTP.…”

Section: Computational Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Immune Genetic Algorithm for the Fixed Charge Transportation Problem

Ma¹

2007

Proceedings on Intelligent Systems and Knowledge Engineering (ISKE2007)

View full text Add to dashboard Cite

An immune genetic algorithm (IGA) for the fixed charge transportation problem is developed based on the immune theory in biology, which constructs an immune operator accomplished by two steps, a vaccination and an immune selection. The methods for selecting vaccines and constructing an immune operator are also proposed. The results of computation demonstrate that IGA can restrain the degenerate phenomenon and improve the search capability compared to genetic algorithm with matrix code and that with edge-set code greatly on large instances.

show abstract

Section: Computational Resultsmentioning

confidence: 99%

“…There are many manners to code the feasible solution for FCTP: Gottlieb and Michalewicz (1991) analyzed some representation schemes for the linear transportation problem [10]. They claimed that bitstrings code is not suited to represent solution candidates, and instead propose GA employing permutations code or matrices code.…”

Section: Initialization Populationmentioning

confidence: 99%

Immune Genetic Algorithm for the Fixed Charge Transportation Problem

Ma¹

2007

Proceedings on Intelligent Systems and Knowledge Engineering (ISKE2007)

View full text Add to dashboard Cite

show abstract

“…There is often a need to take these optimisation objectives of cost and time into account [35]. According to Vignaux and Michalewicz [32], transportation problems seek to determine a minimum-cost transportation plan for a single commodity from a number of sources to a number of destinations.…”

Section: Methodsmentioning

confidence: 99%

A Transportation Model for an Effective Disaster Relief Operation in the Sadc Region

Baraka

Yadavalli

Singh

2017

SAJIE

View full text Add to dashboard Cite

This paper reviews some challenges faced by humanitarian logistics and supply chain organisations in the transportation of resources, evacuees, and emergency supplies for disaster relief operations in the SADC region. To identify the appropriate transportation to assist in the region, three models were reviewed and proposed: A typical transportation problem, a genetic algorithm based on a spanning tree, and a linear optimisation using Excel Solver. Reviewing the literature revealed that both man-made and natural disasters have caused over ninety thousand fatalities and affected millions just over the past three decades. A further review shows that most disaster deaths are the result of poor infrastructure, especially in populated areas. This presents a challenge to relief organisations in their efforts to provide on-time relief to victims in pre-and postdisaster periods. Although each proposed transportation problem has particular complexities, each of them could assist the region to decrease the relief operation response time and cost. This paper provides the reader with a greater understanding of the challenges faced by the humanitarian supply chain in the SADC region. This paper proposes a conceptual model based on an actual empirical case. OPSOMMINGHierdie artikel hersien sommige van die uitdagings wat deur humanitêre logistieke-en voorsieningskettingmaatskappye ervaar word met betrekking tot die vervoer van hulpbronne, ontruiming van vlugtelinge en noodgevalvoorrade vir rampverligting in die Suider-Afrikaanse ontwikkelingsgemeenskap. Om die gepaste vervoertegniek te identifiseer, word drie modelle ondersoek en voorgestel, naamlik 'n tipiese vervoerprobleem, 'n genetiese algoritme gebaseer op 'n uitstrekkende boom en 'n lineêre optimisering. 'n Literatuurstudie het gevind dat beide mensgemaakte-en natuurrampe meer as negentigduisend sterftes veroorsaak het, terwyl dit miljoene geaffekteer het in die afgelope drie dekades. 'n Verdere ondersoek toon ook dat die meeste rampsterftes as gevolg van swak infrastruktuur is, veral in bevolkte areas. Dit skep 'n uitdaging vir rampverligtingorganisasies in hul poging om betyds verligting aan slagoffers te bring. Alhoewel die voorgestelde vervoerprobleme spesifieke kompleksiteite bevat, kon elkeen gebruik word om die streek by te staan om verligtingsaksies se reaksietyd en koste te verminder. 'n Konspetuele model gebaseer op empiriese data word voorgestel.

show abstract

“…Vignaux and Michalewicz (27) developed a GA based methodology for solving a transportation problem. They used the transportation problem as a test case to investigate the relationship between representation structures and genetic operators for constrained optimization.…”

Section: Introductionmentioning

confidence: 99%

Solving Transshipment Problem using EAs: How Good are the Solutions?

Sarker

Namatame

2004

IEEJ Trans.EIS

View full text Add to dashboard Cite

Evolutionary Algorithms have attracted increasing attention in recent years, as powerful computational techniques, for solving many complex real-world problems. The successful application of Evolutionary algorithms to optimization problems is dependent on the methods and parameters used for the algorithms. In this paper, we develop three evolutionary algorithms for solving a transshipment problem. We investigate the effect of population sizes on the quality of solutions to be obtained, the computational time to be required and the size of search spaces of the problems under consideration. We also use a well-known conventional optimization package to compare the quality of solutions. The numerical results are analyzed and the interesting findings are discussed.

show abstract

A genetic algorithm for the linear transportation problem

Cited by 201 publications

References 4 publications

Immune Genetic Algorithm for the Fixed Charge Transportation Problem

Immune Genetic Algorithm for the Fixed Charge Transportation Problem

A Transportation Model for an Effective Disaster Relief Operation in the Sadc Region

Solving Transshipment Problem using EAs: How Good are the Solutions?

Contact Info

Product

Resources

About