基于互联网的连锁企业的物流管理系统--大学毕业论文.doc
![资源得分’ title=](/images/score_1.gif)
![资源得分’ title=](/images/score_1.gif)
![资源得分’ title=](/images/score_1.gif)
![资源得分’ title=](/images/score_1.gif)
![资源得分’ title=](/images/score_05.gif)
《基于互联网的连锁企业的物流管理系统--大学毕业论文.doc》由会员分享,可在线阅读,更多相关《基于互联网的连锁企业的物流管理系统--大学毕业论文.doc(14页珍藏版)》请在淘文阁 - 分享文档赚钱的网站上搜索。
1、An internet-based logistics management system for enterprise chainsN. Prindezis, C.T. KiranoudisSchool of Chemical Engineering, National Technical University, 15780 Athens, GreeceReceived 13 September 2003; received in revised form 20 December 2003; accepted 27 January 2004Available online 10 Decemb
2、er 2004AbstractThis paper presents an Internet-Based Logistics Management System to coordinate and disseminate tasks and related information for solving the heterogeneous vehicle routing problem using appropriate metaheuristic techniques, for use in enterprise chain net works. Its architecture invol
3、ves a JAVA Web applet equipped with interactive communication capabilities between peripheral software tools. The system was developed in distributed software fashion technology for all computer platforms utilizing a Webbrowser, focusing on the detailed road network of Athens and the needs of the At
4、hens Central Food Market enterprises. 2004 Elsevier Ltd. All rights reserved.Keywords: Decision support system; e-Logistics; Transportation; Vehicle routing problem1. IntroductionEnterprise chains are the business model of the present and future regarding markets that involve small and medium compan
5、y sizes. Clearly, grouping activities towards a focused target facilitates an understandably improved market penetration guaranteed by a successful trade mark of a leading company in the field. Several collaboration models that basically include franchising are introduced as a part of this integrate
6、d process. When such a network is introduced in order to exploit a commercial idea or business initiative and subsequently expanded as market penetration grows, several management issues arise regarding the operations of the entire network. Such a network is the ideal place for organizing and evalua
7、ting in a more centralized way several ordinary operations regarding supply chain and logistics Infact, tools developed for organizing management processes and operational needs of each individual company, can be developed in a more centralized fashion and the services provided by the tool can be of
8、fered to each network member to facilitate transactions and tackle operations similarly. Web-based applications are an ideal starting place for developing such applications. Typically such systems serve as a central depot for distributing common services in the field of logistics. The commercial app
9、lication is stored in a central server and services are provided for each member of the group. A prototype of such a server is described in a previous work (Prindezis, Kiranoudis, & Marinos-Kouris,2003). This paper presents the completed inter net system that is installed in the central web server o
10、f the Athens Central Food Market that deals with the integrated problem of distribution for 690 companies that comprise a unique logistics and retail chain of enterprises. The needs of each company are underlined and the algorithms developed are described within the unified internet environment. The
11、 problem solved and services provided for each company is the one involving distribution of goods through a heterogeneous fleet of trucks. New insights of the metaheuristics employed are provided. A characteristic case study is presented to illustrate the effectiveness of the proposed approach for a
12、 real-world problem of distribution through the detailed road network of Athens.2. Distribution through heterogeneous vehicle fleetsThe fleet management problem presented in this paper requires the use of a heterogeneous fleet of vehicles that distribute goods through a network of clients(Tarantilis
13、, Kiranoudis, & Vassiliadis, 2003, 2004).Therefore, the system was designed in order to automatically generate vehicle routes (which vehicles should de-liver to which customers and in which order), using rational, quantitative, spatial and non-spatial information and minimizing simultaneously the ve
14、hicle cost and the total distance travelled by the vehicles, subject to the following constraints:l each vehicle has a predetermined load capacity, typically different from all other vehicles comprising the fleet (heterogeneous nature),l the capacity of a vehicle cannot be exceeded,l a single vehicl
15、e supplies each customers demand,l the number of vehicles used is predetermined.The problem has an obvious commercial value and has drawn the attention of OR community. Its great success can be attributed to the fact that it is a very interesting problem both from the practical and theoretical point
16、s of view. Regarding the practical point of view, the distribution problem involved definitely plays a central role in the efficiency of the operational planning level of distribution management, producing economical routes that contribute to the reduction of distribution costs, offering simultaneou
17、sly significant savings in all related expenses (capital, fuel costs, driver salaries). Its Importance in the practical level, motivated in tense theoretical work and the development of efficient algorithms.For the problem by academic researchers and professional societies in OR/MS, resulting in a n
18、umber of papers concerning the development of a number of Vehicle Routing Information Systems (VRIS) for solving the problem. The problem discussed is an NP-hard optimization problem, that is to say the global optimum of the problem can only be revealed through an algorithm of exponential time or sp
19、ace complexity with respect to problem size. Problems of this type are dealt with heuristic or metaheuristic techniques. Research on the development of heuristic algorithms (Tarantilis & Kiranoudis, 2001,2002a, 2002b) for the fleet management problem has made considerable progress since the first al
20、gorithms that were proposed in the early 60s. Among them, tabu search is the champion (Laporte, Gendreau, Potvin, & Semet,2000). The most powerful tabu search algorithmsare now capable of solving medium size and even largesize instances within extremely small computational environments regarding loa
21、d and time. On the algorithmic side, time has probably come to concentrate on the development of faster, simpler (with few parameters) and more robust algorithms, even if this causes a small loss in quality solution. These attributes are essential if an algorithm is to be implemented in a commercial
22、 package.The algorithm beyond the system developed is of tabu search nature. As mentioned before, since the algorithms cannot reveal the guaranteed global optimum, the time that an algorithm is left to propose a solution to the problem is of utmost importance to the problem. Certainly, there is a tr
23、ade-off between time expected for the induction of the solution and its quality. This part was implemented in a straightforward way. If the system is asked by the user to produce a solution of very high quality instantly, then an aggressive strategy is to be implemented. If the user relaxes the time
24、 of solution to be obtained, that is to say if the algorithm is left to search the solution space more effciently, then there is room for more elaborate algorithms.The algorithm employed has two distinct parts. The first one is a generalized route construction algorithm that creates routes of very g
- 配套讲稿:
如PPT文件的首页显示word图标,表示该PPT已包含配套word讲稿。双击word图标可打开word文档。
- 特殊限制:
部分文档作品中含有的国旗、国徽等图片,仅作为作品整体效果示例展示,禁止商用。设计者仅对作品中独创性部分享有著作权。
- 关 键 词:
- 基于 互联网 连锁 企业 物流 管理 系统 大学毕业 论文
![提示](https://www.taowenge.com/images/bang_tan.gif)
限制150内