《基于互联网的连锁企业的物流管理系统外文翻译-毕业论文》由会员分享，可在线阅读，更多相关《基于互联网的连锁企业的物流管理系统外文翻译-毕业论文（11页珍藏版）》请在金锄头文库上搜索。
1、专业英语课程论文（工业工程09级）姓名：许小会学号：310902020205教师：李发权 2012年 11 月23 日 An internet-based logistics management system for enterprise chainsAbstractThis paper presents an Internet-Based Logistics Management System to coordinate and disseminate tasks and related information for solving the heterogeneous vehicle r
2、outing problem using appropriate heuristic techniques, for use in enterprise chain net works. Its architecture involves a JAVA Web applet equipped with interactive communication capabilities between peripheral software tools. The system was developed in distributed software fashion technology for al
3、l computer platforms utilizing a Web browser, focusing on the detailed road network of Athens and the needs of the Athens Central Food Market enterprises. Keywords: Decision support system; e-Logistics; Transportation; Vehicle routing problem1. IntroductionEnterprise chains are the business model of
4、 the present and future regarding markets that involve small and medium company 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
5、 that basically include franchising are introduced as a part of this integrated 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 t
6、he entire network. Such a network is the ideal place for organizing and evaluating in a more centralized way several ordinary operations regarding supply chain and logistics In fact, tools developed for organizing management processes and operational needs of each individual company, can be develope
7、d in a more centralized fashion and the services provided by the tool can be offered 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
8、 for distributing common services in the field of logistics. The commercial application 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 previous work . This paper presents the completed internet system that is install
9、ed in the central web server of 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 uni
10、fied internet environment. The 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 heuristics employed are provided. A characteristic case study is presented to illustrate the effectiveness of t
11、he proposed approach for a 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 net
12、work of clients. 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 vehicle cost and the total
13、 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 vehicle supplies each customer
14、s demand,l the number of vehicles used is predetermined2.1. NeighborThe neighbor is defined as a blend of the most favorable local search moves that transforms one solution to another. In particular, in its taboo search iteration the type of move adopted is decided stochastically. A predefined proba
15、bility level is assigned to each move type. After that, it is decided whether the move operation is performed within a single route or between different routes, once more stochastically. This time, for both operations, the probability level is assigned a value of 50%. Subsequently, the best neighbor
16、 that the selected move implies is computed. The move types employed are the 2-Opt move (Bell et al., 1983), the 11 Exchange move, the10 Exchange, on both single route and different routes.2.2. Short-term memoryShort-term memory, known as taboo list, is the most often used component of taboo search. Taboo list is imposed to restrict the search from revisiting solutions that were considered pre
