Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 1

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote Retraction: Clusters analysis application on transportation network
EN
The government of Sri Lanka established several economic centres in the provinces according to the budget proposals in the year 1998. The Dambulla economic centre was the first such centre that was established on the 01st of April 1999. Thereafter, a number of economic centres were established throughout the island. However, the Dambulla main hub remained the central warehouse of vegetables in the island. This paper deals with a vehicle scheduling problem related to transportation, and investigates a method whereby a solution can be arrived at to overcome the problem using linear programming (LP). Marketing Department Logistics (MDL) Ltd needs to distribute vegetables and fruits to different provinces. Its main hub is situated near the Dambulla vegetable and fruit market, and minor hubs are situated in different provinces in Sri Lanka. The main objective of this research is building a cost minimized model which creates a suitable method for delivering vegetables and fruits from the Dambulla major hub through its minor hubs to outlets in the provinces. Hence, to optimize the cost of outbound distribution, a mathematical model has been developed by using Integer Linear Programming, and by using reliable sources to collect data. Software assistance was obtained using the LINGO 06 optimizer, Java, MS Access and MS Excel tools to solve this mathematical model. This study is based on the Dambulla economic centre. This is an initial step to bring a correct protocol to arrange a transport model to distribute the vegetables and fruits from this centre in a cost-effective way. According to this study, all districts in Sri Lanka could be divided into four clusters. At the beginning of this research, we assumed that each district contains two warehouses and three vendors. This model is flexible enough to be re-scheduled at any request. It paves the way to create a larger model for solving any type of transportation planning problem.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.