https://www.ijmst.com/
IJMST Volume 1 Issue 2, Manuscript 4
The main objective of this paper is to discuss Vehicle Routing Problem (VRP) for Public
Distribution System (PDS) including multi-depots, dispatching quantity, routes arrangement
and time-window constraints in order to reduce the delivering cost. The developed algorithm
first employs the heuristic search for feasible solutions based on the constraints of both the
time-window and loading capacity in the routing problem keeping the concept of nearestneighbor. Then the Best Case search algorithm is developed to select the best solutions
simultaneously to gain a optimal solution in the problem domain.
Currently the operators in the telecommunications market present offers of subscription to the consumers,and given that competition is strong in this area, most of these advertising offers are prepared to attract and / or keep customers. For this reason, customers face problems in choosing operators that meet their needs in terms of price, quality of service (QoS), etc..., while taking into account the margin between what is advertising and what is real. Therefore, we are led to solve a problem of decision support. Mathematical modeling of this problem led to the solution of an inverse problem. Specifi-cally, the inverse problem is to find the real Quality of Service (QoS) function knowing the theoretical QoS. To solve this problem we have reformulated in an optimization problem of minimizing the difference between the real quality of service (QoS) and theoretical (QoS). This model will help customers who seek to know the degree of sincerity of Their operators, as well as it is an opportunity for operators who want to maintain their resources so that they gain the trust of customers. The resulting optimization problem is solved using evolutionary algorithms. The numerical results showed the reliability and credibility of our inverse model and the performance and effectiveness of our approach.
A NEW APPROACH IN PACKET SCHEDULING IN THE VANET ijasuc
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety
and comfort in the future. When many vehicles want to access data through roadside unit, data scheduling
become an important issue. In this paper, we identify some challenges in roadside based data access. To
address these challenges we first review some existing scheduling schemes. We then propose a priority
scheduling and finally show that using this idea can increase QOS compare to previous algorithms.
Projection pursuit Random Forest using discriminant feature analysis model fo...IJECEIAES
A major and demand issue in the telecommunications industry is the prediction of churn customers. Churn describes the customer who attrites from the current provider to competitors searching for better service offers. Companies from the Telco sector frequently have customer relationship management offices it is the main objective in how to win back defecting clients because preserve long-term customers can be much more beneficial than gain newly recruited customers. Researchers and practitioners are paying great attention to developing a robust customer churn prediction model, especially in the telecommunication business by proposed numerous machine learning approaches. Many approaches of Classification are established, but the most effective in recent times is a tree-based method. The main contribution of this research is to predict churners/non-churners in the Telecom sector based on project pursuit Random Forest (PPForest) that uses discriminant feature analysis as a novelty extension of the conventional Random Forest for learning oblique Project Pursuit tree (PPtree). The proposed methodology leverages the advantage of two discriminant analysis methods to calculate the project index used in the construction of PPtree. The first method used Support Vector Machines (SVM) while, the second method used Linear Discriminant Analysis (LDA) to achieve linear splitting of variables during oblique PPtree construction to produce individual classifiers that are robust and more diverse than classical Random Forest. It is found that the proposed methods enjoy the best performance measurements e.g. Accuracy, hit rate, ROC curve, Lift, H-measure, AUC. Moreover, PPForest based on LDA delivers effective evaluators in the prediction model.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
FACILITY LOCATION IN LOGISTIC NETWORK DESIGN USING SOFT COMPUTING OPTIMIZATIO...ijcsit
Discovery of the optimal best possibility of location for facilities is the central problem associated in logistics management. The optimal places for the distribution centres (DCs) can be based on the selected attributes that are crucial to locate the best possible locations to increase the speed of the facility service and thus reduce the overall transport cost and time and to provide best service. The major task is to identifying and locating the required number of DCs and its optimum locations are considered as the important goals for the design of any logistics network. The number of DCs will clearly depends upon many factors like population, capacity of the facility, type of facility etc. but locating the optimum locations of DCs will reduce the overall cost. But, for solving such a wide problem space, the powerful tools are the soft computing based approaches and that are well suited and find a meaningful solution in finite time. In this work, we are going to find the optimum locations of DCs for logistics using various soft computing methods.
Discovery of the optimal best possibility of location for facilities is the central problem associated in logistics management. The optimal places for the distribution centres (DCs) can be based on the selected attributes that are crucial to locate the best possible locations to increase the speed of the facility service and thus reduce the overall transport cost and time and to provide best service. The major task is to identifying and locating the required number of DCs and its optimum locations are considered as the important goals for the design of any logistics network. The number of DCs will clearly depends upon many factors like population, capacity of the facility, type of facility etc. but locating the optimum locations of DCs will reduce the overall cost. But, for solving such a wide problem space, the powerful tools are the soft computing based approaches and that are well suited and find a meaningful solution in finite time. In this work, we are going to find the optimum locations of DCs for logistics using various soft computing methods.
Currently the operators in the telecommunications market present offers of subscription to the consumers,and given that competition is strong in this area, most of these advertising offers are prepared to attract and / or keep customers. For this reason, customers face problems in choosing operators that meet their needs in terms of price, quality of service (QoS), etc..., while taking into account the margin between what is advertising and what is real. Therefore, we are led to solve a problem of decision support. Mathematical modeling of this problem led to the solution of an inverse problem. Specifi-cally, the inverse problem is to find the real Quality of Service (QoS) function knowing the theoretical QoS. To solve this problem we have reformulated in an optimization problem of minimizing the difference between the real quality of service (QoS) and theoretical (QoS). This model will help customers who seek to know the degree of sincerity of Their operators, as well as it is an opportunity for operators who want to maintain their resources so that they gain the trust of customers. The resulting optimization problem is solved using evolutionary algorithms. The numerical results showed the reliability and credibility of our inverse model and the performance and effectiveness of our approach.
A NEW APPROACH IN PACKET SCHEDULING IN THE VANET ijasuc
Vehicular Ad hoc Networks (VANET) are expected to have great potential to improve both traffic safety
and comfort in the future. When many vehicles want to access data through roadside unit, data scheduling
become an important issue. In this paper, we identify some challenges in roadside based data access. To
address these challenges we first review some existing scheduling schemes. We then propose a priority
scheduling and finally show that using this idea can increase QOS compare to previous algorithms.
Projection pursuit Random Forest using discriminant feature analysis model fo...IJECEIAES
A major and demand issue in the telecommunications industry is the prediction of churn customers. Churn describes the customer who attrites from the current provider to competitors searching for better service offers. Companies from the Telco sector frequently have customer relationship management offices it is the main objective in how to win back defecting clients because preserve long-term customers can be much more beneficial than gain newly recruited customers. Researchers and practitioners are paying great attention to developing a robust customer churn prediction model, especially in the telecommunication business by proposed numerous machine learning approaches. Many approaches of Classification are established, but the most effective in recent times is a tree-based method. The main contribution of this research is to predict churners/non-churners in the Telecom sector based on project pursuit Random Forest (PPForest) that uses discriminant feature analysis as a novelty extension of the conventional Random Forest for learning oblique Project Pursuit tree (PPtree). The proposed methodology leverages the advantage of two discriminant analysis methods to calculate the project index used in the construction of PPtree. The first method used Support Vector Machines (SVM) while, the second method used Linear Discriminant Analysis (LDA) to achieve linear splitting of variables during oblique PPtree construction to produce individual classifiers that are robust and more diverse than classical Random Forest. It is found that the proposed methods enjoy the best performance measurements e.g. Accuracy, hit rate, ROC curve, Lift, H-measure, AUC. Moreover, PPForest based on LDA delivers effective evaluators in the prediction model.
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
FACILITY LOCATION IN LOGISTIC NETWORK DESIGN USING SOFT COMPUTING OPTIMIZATIO...ijcsit
Discovery of the optimal best possibility of location for facilities is the central problem associated in logistics management. The optimal places for the distribution centres (DCs) can be based on the selected attributes that are crucial to locate the best possible locations to increase the speed of the facility service and thus reduce the overall transport cost and time and to provide best service. The major task is to identifying and locating the required number of DCs and its optimum locations are considered as the important goals for the design of any logistics network. The number of DCs will clearly depends upon many factors like population, capacity of the facility, type of facility etc. but locating the optimum locations of DCs will reduce the overall cost. But, for solving such a wide problem space, the powerful tools are the soft computing based approaches and that are well suited and find a meaningful solution in finite time. In this work, we are going to find the optimum locations of DCs for logistics using various soft computing methods.
Discovery of the optimal best possibility of location for facilities is the central problem associated in logistics management. The optimal places for the distribution centres (DCs) can be based on the selected attributes that are crucial to locate the best possible locations to increase the speed of the facility service and thus reduce the overall transport cost and time and to provide best service. The major task is to identifying and locating the required number of DCs and its optimum locations are considered as the important goals for the design of any logistics network. The number of DCs will clearly depends upon many factors like population, capacity of the facility, type of facility etc. but locating the optimum locations of DCs will reduce the overall cost. But, for solving such a wide problem space, the powerful tools are the soft computing based approaches and that are well suited and find a meaningful solution in finite time. In this work, we are going to find the optimum locations of DCs for logistics using various soft computing methods.
Study of Congestion Control Scheme with Decentralized Threshold Function in V...ijtsrd
With the constant increase in vehicular traffic, existing traffic management solutions have become inefficient. Urbanization has led to an increase in traffic jams and accidents in major cities. In order to accommodate the growing needs of transport systems today, there is a need for an Intelligent Transport System. Vehicular Ad hoc Network VANET is a growing technology that assists in Intelligent Transport Systems. VANETs enable communication between vehicles as well as fixed infrastructure called Road Side Units RSU . We propose a distributed, collaborative traffic congestion detection and dissemination system that uses VANET. Each of the driver's smart phones is equipped with a Traffic App which is capable of location detection through Geographic Position based System GPS . This information is relayed to a remote server which detects traffic congestion. Once congestion is confirmed the congestion information is disseminated to the end user phone through RSUs. The Mobile App transmits the location information at periodic intervals. Using the latitude, longitude and the current time, the location of each vehicle is traced. Using location information, the distance moved by the vehicle at a given time is monitored. If the value is below a fixed threshold, congestion is suspected in a particular area. If many vehicles in the same area send similar messages, traffic congestion is confirmed. Once traffic congestion is confirmed, the vehicles approaching the congested area are informed about the traffic through display boards that are available in the nearest RSUs traffic signals . The congestion information is also made available through the Mobile App present in vehicles approaching the congested area. The approaching vehicles may take diversion and alleviate congestion. Anees Khan | Prof. Sarwes Site "Study of Congestion Control Scheme with Decentralized Threshold Function in VANETs" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd25324.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/25324/study-of-congestion-control-scheme-with-decentralized-threshold-function-in-vanets/anees-khan
Intensification of the supply chain by the storing of trajectories data ijmvsc
To improve the profitability and the quality of services, and to confront the difficult competition, companies are in search of the effective approaches to improve their professions in general, and the management of the supply chain in particular which plays an essential role for reduction of cost, the improvement of the quality of services, and increase of the productivity. This work aims to improve the performance of supply chain by the conception of trajectories data warehouse intended to collect the data relative to the mobile objects. The information stored in the data warehouse will be analyzed to extract knowledge which we use to a decision-making and leading to strengthen the management of the supply chain.
Intensification of the supply chain by the storing of trajectories dataijmvsc
To improve the profitability and the quality of services, and to confront the difficult competition, companies are in search of the effective approaches to improve their professions in general, and the management of the supply chain in particular which plays an essential role for reduction of cost, the improvement of the quality of services, and increase of the productivity. This work aims to improve the performance of supply chain by the conception of trajectories data warehouse intended to collect the data relative to the mobile objects. The information stored in the data warehouse will be analyzed to extract knowledge which we use to a decision-making and leading to strengthen the management of the supply chain.
Assignment on logistic and Supply chain Management Anup Roy
future prospect of logistic management
Geographic information System (GIS) and global positions system (GPS) influence logistic management
the different form of Logistic Management
Intelligent Traffic Management System using Shortest Pathijtsrd
Due to current significant increases in population and consequently in traffic congestion in most metropolitan cities in the world, designing of an intelligent traffic management system ITMS in order to detect the path with the shortest travel time is critical for emergency, health, and courier services. The aim of this research study was to develop a theoretical traffic detection system and capable of estimating the travel time associated with each street segment based on the traffic data updated every 20 seconds, which successively finds the path with the shortest travel time in the network by using a dynamic programming technique. Furthermore, in this study we model the travel time associated with each street segment based on the historical and real time data considering that the traffic speed on each road segment is piecewise constant. It would be useful to implement such algorithms in GIS systems such as Google map in such a way that the service delivery drivers can avoid congested routes by receiving real time traffic information. Bharti Kumari | Vinod Mahor "Intelligent Traffic Management System using Shortest Path" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-5 , August 2022, URL: https://www.ijtsrd.com/papers/ijtsrd50598.pdf Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/50598/intelligent-traffic-management-system-using-shortest-path/bharti-kumari
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
INTEGRATION OF GIS AND OPTIMIZATION ROUTINES FOR THE VEHICLE ROUTING PROBLEMijccmsjournal
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to
test the proposed approach.
With the development of the urbanization, industrialization and populace, there has been a huge development in the rush hour gridlock. With development in the rush hour gridlock, there got a heap of issues with it as well, these issues incorporate congested roads, mishaps and movement govern infringement at the overwhelming activity signals. This thusly adversy affects the economy of the nation and in addition the loss of lives. Thus, Speed control is in the need of great importance because of the expanded rate of mishaps announced in our everyday life. The criminal traffic offense expanded due to over movement on streets. The reason is rapid of vehicles. The speed of the vehicles is past the normal speed confine is called speed infringement. In this paper diverse issues are confronted that are given in issue detailing. Every one of these issues are in future with the assistance of the fortification learning issue and advancement issue the changed neural system is contemplated with NN calculations forward Chaining back spread . Omesh Goyal | Chamkour Singh ""A Review on Traffic Signal Identification"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23557.pdf
Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/23557/a-review-on-traffic-signal-identification/omesh-goyal
A combined fuzzy AHP with fuzzy TOPSIS to locate industrial supporting bonded...TELKOMNIKA JOURNAL
Raw material availability is critical for the sustainability of industrial activity. A bonded logistics centre is required as a multipurpose warehouse for the storage of raw commodities, particularly those imported from other countries. The operationalization of bonded logistics centers in terms of supplying raw materials effectively and efficiently is largely location dependent. Proper facility placement is critical for resolving the storage issue and boosting the efficiency of the transportation system. The purpose of this article is to suggest a technique for locating a bonded logistics centre. In an unpredictable context, decision making requires a range of criteria generated from knowledge and stakeholder experience. As a result, this work proposes the combination of the fuzzy analytic hierarchy process (FAHP) with the fuzzy technique for ordering preferences by similarity to ideal solution (FTOPSIS). By disclosing linguistic characteristics, fuzzy numbers contribute to the resolution of ambiguity and imprecision. Obtaining the weighted value of the criteria and sub-criteria using fuzzy AHP. Using fuzzy TOPSIS, determining alternate preferences based on weighting factors. Its use lies in being able to distinguish between criteria that provide advantages and those that generate expenses. The findings indicate that the selected option is the one that is most closely related to the positive ideal.
Call for Papers - Journal of Indian School of Political Economy, E-ISSN 0971-...Christo Ananth
The journal is published every quarter and contains 200 pages in each issue. It is devoted to the study of Indian economy, polity and society. Research papers, review articles, book reviews are published in the journal. All research papers published in the journal are subject to an intensive refereeing process. Each issue of the journal also includes a section on documentation, which reproduces extensive excerpts of relevant reports of committees, working groups, task forces, etc., which may not be readily accessible, official documents compiled from scattered electronic and/or other sources and statistical supplement for ready reference of the readers. It is now in its nineteenth year of publication. So far, five special issues have been brought out, namely: (i) The Scheduled Castes: An Inter-Regional Perspective, (ii) Political Parties and Elections in Indian States : 1990-2003, (iii) Child Labour, (iv) World Trade Organisation Agreements, and (v) Basel-II and Indian Banks
Omni-Channel Distribution: A Transshipment Modeling Perspectiveijmvsc
In our work, we develop a specialized optimization technique that adapts the general linear programming Transshipment model to the ever-growing needs of Omni-Channel distribution in Supply Chain Management. With the rapid adoption of “smart” mobile technologies, customers now acquire merchandise across multiple channels and devices. As a result, retailers are challenged with downstream operational complexities.
Fulfillment of customer orders now changes the placement and amount of independent demand inventory organizations may hold. Our research integrates the use of Hub or Fulfillment Centers, locations where sellers fill customer orders placed through e-commerce, as an additional segment of demand. This adaptation to the optimization of Transshipment can result in significant benefits to the firm’s logistics presence, customer retention, and profit.
Multi objective evolutionary simulation optimization of personnel schedulingijaia
This paper presents an evolutionary multi-objective simulation-optimization system for personnel scheduling. The system is developed for the Swedish postal services and aims at finding personnel schedules that minimizes both total man hours and the administrative burden of the person responsible for handling schedules. For the optimization, the multi-objective evolutionary algorithm NSGA-II is implemented. In order to make the optimization fast enough, a two-level parallelisation model is being
adopted. The simulation-optimization system is evaluated on a real-world test case and results from the evaluation shows that the algorithm is successful in optimizing the problem.
tps://www.ijmst.com/
IJMST Volume 1 Issue 7, Manuscript 3
This research work investigates Online Appointment System Services offered by hospital
websites to study the effective use of information and communication technology. Medical
appointments allow sufficient time for each patient‘s medical condition to be examined
thoroughly. Among various methods used in booking appointments, online appointment
booking is promising. This research work aims to investigate the Online Appointment
Service of Hospitals in India, to assess online appointment service process and to build an
improved online appointment model. Descriptive research method was employed in the
study. There are a few multi-speciality hospitals offering online appointments for
research, but most hospitals in India are yet to initiate online appointment facility. The
proposed new online appointment model which has evolved out of this research work
suggests efficient solutions to enable hospitals to provide better healthcare delivery using ICT
applications.
https://www.ijmst.com/
IJMST Volume 1 Issue 5, Manuscript 6
The study will investigate the effects of ethical buying behaviour on retail organizations
performance with a bias on supermarkets in Kakamega town. Increased competition has
pressured retail organizations to initiate innovative ways of maintaining competitive
advantage. Leading retail organizations are today focusing on effectively managing their
procurement function in a professional way as a component of supply chain management in
order to lower cost operation costs and improve on their bottom line. However, some retail
organizations have not fully embraced ethical buying behaviour. As a result such
organizations have continued to post dismal financial results, stagnation in their growth and
erosion in bottom line profitability. The study was carried out with the objectives to
determine the effect of ethical buying behaviour procurement automation on supermarkets
performance. The study may help managers adopt ethical buying behaviour that will enhance
performance and formulate appropriate policies. It will contribute to the academics point out
areas for further research by other researchers. It used a descriptive to explain the relationship
between ethical buying behaviour on the four mainstream retail supermarkets in Kakamega
town, Kenya. Data was collected using structured questionnaires and also from the review of
existing literature. The gathered data was analysed using descriptive and inferential statistics.
The findings were presented using standard methods such as frequency distribution tables.
Statistical package for social sciences (SPSS) computer software will be used to compute,
analyse and present the findings. Ethical buyer behaviour affects supermarket performance.
More Related Content
Similar to Development and Analysis of Transportation model in Public Distribution System (PDS) for Warangal district
Study of Congestion Control Scheme with Decentralized Threshold Function in V...ijtsrd
With the constant increase in vehicular traffic, existing traffic management solutions have become inefficient. Urbanization has led to an increase in traffic jams and accidents in major cities. In order to accommodate the growing needs of transport systems today, there is a need for an Intelligent Transport System. Vehicular Ad hoc Network VANET is a growing technology that assists in Intelligent Transport Systems. VANETs enable communication between vehicles as well as fixed infrastructure called Road Side Units RSU . We propose a distributed, collaborative traffic congestion detection and dissemination system that uses VANET. Each of the driver's smart phones is equipped with a Traffic App which is capable of location detection through Geographic Position based System GPS . This information is relayed to a remote server which detects traffic congestion. Once congestion is confirmed the congestion information is disseminated to the end user phone through RSUs. The Mobile App transmits the location information at periodic intervals. Using the latitude, longitude and the current time, the location of each vehicle is traced. Using location information, the distance moved by the vehicle at a given time is monitored. If the value is below a fixed threshold, congestion is suspected in a particular area. If many vehicles in the same area send similar messages, traffic congestion is confirmed. Once traffic congestion is confirmed, the vehicles approaching the congested area are informed about the traffic through display boards that are available in the nearest RSUs traffic signals . The congestion information is also made available through the Mobile App present in vehicles approaching the congested area. The approaching vehicles may take diversion and alleviate congestion. Anees Khan | Prof. Sarwes Site "Study of Congestion Control Scheme with Decentralized Threshold Function in VANETs" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-5 , August 2019, URL: https://www.ijtsrd.com/papers/ijtsrd25324.pdfPaper URL: https://www.ijtsrd.com/computer-science/other/25324/study-of-congestion-control-scheme-with-decentralized-threshold-function-in-vanets/anees-khan
Intensification of the supply chain by the storing of trajectories data ijmvsc
To improve the profitability and the quality of services, and to confront the difficult competition, companies are in search of the effective approaches to improve their professions in general, and the management of the supply chain in particular which plays an essential role for reduction of cost, the improvement of the quality of services, and increase of the productivity. This work aims to improve the performance of supply chain by the conception of trajectories data warehouse intended to collect the data relative to the mobile objects. The information stored in the data warehouse will be analyzed to extract knowledge which we use to a decision-making and leading to strengthen the management of the supply chain.
Intensification of the supply chain by the storing of trajectories dataijmvsc
To improve the profitability and the quality of services, and to confront the difficult competition, companies are in search of the effective approaches to improve their professions in general, and the management of the supply chain in particular which plays an essential role for reduction of cost, the improvement of the quality of services, and increase of the productivity. This work aims to improve the performance of supply chain by the conception of trajectories data warehouse intended to collect the data relative to the mobile objects. The information stored in the data warehouse will be analyzed to extract knowledge which we use to a decision-making and leading to strengthen the management of the supply chain.
Assignment on logistic and Supply chain Management Anup Roy
future prospect of logistic management
Geographic information System (GIS) and global positions system (GPS) influence logistic management
the different form of Logistic Management
Intelligent Traffic Management System using Shortest Pathijtsrd
Due to current significant increases in population and consequently in traffic congestion in most metropolitan cities in the world, designing of an intelligent traffic management system ITMS in order to detect the path with the shortest travel time is critical for emergency, health, and courier services. The aim of this research study was to develop a theoretical traffic detection system and capable of estimating the travel time associated with each street segment based on the traffic data updated every 20 seconds, which successively finds the path with the shortest travel time in the network by using a dynamic programming technique. Furthermore, in this study we model the travel time associated with each street segment based on the historical and real time data considering that the traffic speed on each road segment is piecewise constant. It would be useful to implement such algorithms in GIS systems such as Google map in such a way that the service delivery drivers can avoid congested routes by receiving real time traffic information. Bharti Kumari | Vinod Mahor "Intelligent Traffic Management System using Shortest Path" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-5 , August 2022, URL: https://www.ijtsrd.com/papers/ijtsrd50598.pdf Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/50598/intelligent-traffic-management-system-using-shortest-path/bharti-kumari
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
INTEGRATION OF GIS AND OPTIMIZATION ROUTINES FOR THE VEHICLE ROUTING PROBLEMijccmsjournal
This paper evokes the vehicle routing problem (VRP) which aims to determine the minimum total cost pathways for a fleet of heterogeneous vehicles to deliver a set of customers' orders. The inability of optimization algorithms alone to fully satisfy the needs of logistic managers become obvious in transportation field due to the spatial nature of such problems. In this context, we couple a geographical information system (GIS) with a metaheuristic to handle the VRP efficiently then generate a geographical solution instead of the numerical solution. A real-case instance in a Tunisian region is studied in order to
test the proposed approach.
With the development of the urbanization, industrialization and populace, there has been a huge development in the rush hour gridlock. With development in the rush hour gridlock, there got a heap of issues with it as well, these issues incorporate congested roads, mishaps and movement govern infringement at the overwhelming activity signals. This thusly adversy affects the economy of the nation and in addition the loss of lives. Thus, Speed control is in the need of great importance because of the expanded rate of mishaps announced in our everyday life. The criminal traffic offense expanded due to over movement on streets. The reason is rapid of vehicles. The speed of the vehicles is past the normal speed confine is called speed infringement. In this paper diverse issues are confronted that are given in issue detailing. Every one of these issues are in future with the assistance of the fortification learning issue and advancement issue the changed neural system is contemplated with NN calculations forward Chaining back spread . Omesh Goyal | Chamkour Singh ""A Review on Traffic Signal Identification"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23557.pdf
Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/23557/a-review-on-traffic-signal-identification/omesh-goyal
A combined fuzzy AHP with fuzzy TOPSIS to locate industrial supporting bonded...TELKOMNIKA JOURNAL
Raw material availability is critical for the sustainability of industrial activity. A bonded logistics centre is required as a multipurpose warehouse for the storage of raw commodities, particularly those imported from other countries. The operationalization of bonded logistics centers in terms of supplying raw materials effectively and efficiently is largely location dependent. Proper facility placement is critical for resolving the storage issue and boosting the efficiency of the transportation system. The purpose of this article is to suggest a technique for locating a bonded logistics centre. In an unpredictable context, decision making requires a range of criteria generated from knowledge and stakeholder experience. As a result, this work proposes the combination of the fuzzy analytic hierarchy process (FAHP) with the fuzzy technique for ordering preferences by similarity to ideal solution (FTOPSIS). By disclosing linguistic characteristics, fuzzy numbers contribute to the resolution of ambiguity and imprecision. Obtaining the weighted value of the criteria and sub-criteria using fuzzy AHP. Using fuzzy TOPSIS, determining alternate preferences based on weighting factors. Its use lies in being able to distinguish between criteria that provide advantages and those that generate expenses. The findings indicate that the selected option is the one that is most closely related to the positive ideal.
Call for Papers - Journal of Indian School of Political Economy, E-ISSN 0971-...Christo Ananth
The journal is published every quarter and contains 200 pages in each issue. It is devoted to the study of Indian economy, polity and society. Research papers, review articles, book reviews are published in the journal. All research papers published in the journal are subject to an intensive refereeing process. Each issue of the journal also includes a section on documentation, which reproduces extensive excerpts of relevant reports of committees, working groups, task forces, etc., which may not be readily accessible, official documents compiled from scattered electronic and/or other sources and statistical supplement for ready reference of the readers. It is now in its nineteenth year of publication. So far, five special issues have been brought out, namely: (i) The Scheduled Castes: An Inter-Regional Perspective, (ii) Political Parties and Elections in Indian States : 1990-2003, (iii) Child Labour, (iv) World Trade Organisation Agreements, and (v) Basel-II and Indian Banks
Omni-Channel Distribution: A Transshipment Modeling Perspectiveijmvsc
In our work, we develop a specialized optimization technique that adapts the general linear programming Transshipment model to the ever-growing needs of Omni-Channel distribution in Supply Chain Management. With the rapid adoption of “smart” mobile technologies, customers now acquire merchandise across multiple channels and devices. As a result, retailers are challenged with downstream operational complexities.
Fulfillment of customer orders now changes the placement and amount of independent demand inventory organizations may hold. Our research integrates the use of Hub or Fulfillment Centers, locations where sellers fill customer orders placed through e-commerce, as an additional segment of demand. This adaptation to the optimization of Transshipment can result in significant benefits to the firm’s logistics presence, customer retention, and profit.
Multi objective evolutionary simulation optimization of personnel schedulingijaia
This paper presents an evolutionary multi-objective simulation-optimization system for personnel scheduling. The system is developed for the Swedish postal services and aims at finding personnel schedules that minimizes both total man hours and the administrative burden of the person responsible for handling schedules. For the optimization, the multi-objective evolutionary algorithm NSGA-II is implemented. In order to make the optimization fast enough, a two-level parallelisation model is being
adopted. The simulation-optimization system is evaluated on a real-world test case and results from the evaluation shows that the algorithm is successful in optimizing the problem.
Similar to Development and Analysis of Transportation model in Public Distribution System (PDS) for Warangal district (20)
tps://www.ijmst.com/
IJMST Volume 1 Issue 7, Manuscript 3
This research work investigates Online Appointment System Services offered by hospital
websites to study the effective use of information and communication technology. Medical
appointments allow sufficient time for each patient‘s medical condition to be examined
thoroughly. Among various methods used in booking appointments, online appointment
booking is promising. This research work aims to investigate the Online Appointment
Service of Hospitals in India, to assess online appointment service process and to build an
improved online appointment model. Descriptive research method was employed in the
study. There are a few multi-speciality hospitals offering online appointments for
research, but most hospitals in India are yet to initiate online appointment facility. The
proposed new online appointment model which has evolved out of this research work
suggests efficient solutions to enable hospitals to provide better healthcare delivery using ICT
applications.
https://www.ijmst.com/
IJMST Volume 1 Issue 5, Manuscript 6
The study will investigate the effects of ethical buying behaviour on retail organizations
performance with a bias on supermarkets in Kakamega town. Increased competition has
pressured retail organizations to initiate innovative ways of maintaining competitive
advantage. Leading retail organizations are today focusing on effectively managing their
procurement function in a professional way as a component of supply chain management in
order to lower cost operation costs and improve on their bottom line. However, some retail
organizations have not fully embraced ethical buying behaviour. As a result such
organizations have continued to post dismal financial results, stagnation in their growth and
erosion in bottom line profitability. The study was carried out with the objectives to
determine the effect of ethical buying behaviour procurement automation on supermarkets
performance. The study may help managers adopt ethical buying behaviour that will enhance
performance and formulate appropriate policies. It will contribute to the academics point out
areas for further research by other researchers. It used a descriptive to explain the relationship
between ethical buying behaviour on the four mainstream retail supermarkets in Kakamega
town, Kenya. Data was collected using structured questionnaires and also from the review of
existing literature. The gathered data was analysed using descriptive and inferential statistics.
The findings were presented using standard methods such as frequency distribution tables.
Statistical package for social sciences (SPSS) computer software will be used to compute,
analyse and present the findings. Ethical buyer behaviour affects supermarket performance.
https://www.ijmst.com/
IJMST Volume 1 Issue 5, Manuscript 4
The research was based on the fact that an inadequate fund is the biggest problem facing the
Savings and Co-operative (SACCO) in Kenya. Basing on this, the researcher carried out a
study on how this financial shortage comes about, its influences on the operations of
SACCOs and proposed solutions for handling the problem. The researcher adopted purposive
sampling selecting a total of 37 individuals to make it into the sample population. This
method of sampling was preferred since it was suitable in selecting individuals who
possessed knowledge on the financial issues affecting SACCOs. It employed interview
guides and questionnaires as major instruments for data collection. The data collection
process was programmed to be completed in a two-week timeframe. Thereafter, data analysis
entailed scrutiny of the data with the aim of checking for the level of its accuracy. It was from
the results of data analysis that the study drew its conclusions and recommendations.
Financial mismatch negatively affect SACCO performance. There is need to ensure sound
management practices and policies for SACCOs to perform well.
https://www.ijmst.com/
IJMST Volume 1 Issue 5, Manuscript 3
This study sought to examine the effect of tax authority regulation and administration on
voluntary compliance among small-scale businesses in Kakamega Municipality. The
beneficiaries of the study are to be the Kenya revenue authority and relevant tax agencies. It
may serve as input in designing the tax system both at the counties and national government;
may serve as a reference for further studies in this area The research design adopted was a
descriptive survey as the findings were be generalized to a large population and it will
determine the current situation on the ground thereby providing the opportunity to improve it
accordingly. Data was collected using structured questionnaires to 124 sampled taxpayers
purposively sampled. Markets were stratified in the identification of business. The project
was analyzed using descriptive statistics and SPSS. The taxpayers do not to comply with the
tax laws due to overstatement of tax rates or lack of tax equity and ineffectiveness of the tax
authority. It needs to strengthen itself by educating and training its employees, by
computerizing its operations and devoting additional resources.
https://www.ijmst.com/
IJMST Volume 1 Issue 4, Manuscript 3
Communication is critical for organizational performance. It transfers and conveys
information and ideas. Poor, lack of or limited communication has led to failure in achieving
purposes. Management and employees spend most of their time communicating. The purpose
of this study was to examine the role of communication policies in enhancing Kenyan public
universities performance. The objective was to examine the role of communication policies in
enhancing Kenyan public universities performance; a case of Masinde Muliro University of
Science and Technology (MMUST). It is hoped the findings and recommendations would
enlighten stakeholders to seriously consider communication policies for excellent
performance. The study population comprised of members of teaching, non-teaching staff
and student leaders.. The population stratified and randomly sampled to select 100
respondents. Questionnaires, interviews and content analysis were used for data collection.
Reliability was accepted at above 0.7. Validity was established through careful preparation
of items in instruments based on study objectives and by experts from the school of Human
Resource Development checking content validity. The data was analyzed and interpreted
using descriptive statistics and presented in pie charts and tables. Inferential statistics
involving one-way ANOVA, regression analysis and Chi Square test were used to establish
the significance and associations of the study variables. Findings shown that communication
policies have a direct and positive association on performance. It was recommended that
MMUST amend communication policies on a continuous basis as the need arises.
https://www.ijmst.com/
IJMST Volume 1 Issue 3, Manuscript 3
The study evaluated employee perception on remuneration scheme on staff turnover in
Kenyan Private Universities with the Kenya Methodist University as the case study. The
objective of the study was to evaluate remuneration scheme in relation to staff turnover in
Kenyan Private Universities and to ultimately come up with appropriate recommendations
that would facilitate the reduction of staff turnover in private universities. It is hoped
university administration, government and other human resource policy makers and
employees will greatly benefit from the findings. The descriptive research design was used to
obtain data from the targeted and accessible population which comprised of teaching and
non-teaching staff at the Nairobi and Nakuru Methodist University campuses. 136
respondents were selected purposively. Self-developed questionnaires were administered personally to respondents to gather the information. The data collected was analyzed using tables, frequency distributions and percentages. The statistical package for social sciences
(SPSS) was used to assist in the analysis process. Remuneration is key in retaining workers in any organization and it must be the purpose of any human resource management to design a
competitive remuneration package which will serve to attract, retain, and motivate staff so as to ensure the ultimate organization’s commercial and financial viability.
https://www.ijmst.com/
IJMST Volume 1 Issue 2, Manuscript 2
Trained and competent medical practitioners are the basis of an effective health system and
severe shortage of such professionals can prove to be detrimental to patients. One of the
major challenges that medical practitioners face is ensuring that their medical knowledge
remains updated. However, in India, the population is very huge and it is a mammoth task to
provide current and updated healthcare practices. Hence, it requires an effective and
convenient medium without demographical and geographical boundaries to provide new
knowledge to the medical practitioners, amidst their busy schedules of patient care and
healthcare delivery. To improve the knowledge base under any difficult situations, existing
Information and Communication Technologies (ICTs) can be used to disseminate knowledge
for enhanced health care delivery. The objective of this research work is to study and analyse
Video Conferencing based model for medical knowledge through questionnaire based survey
followed up with critical analysis. The findings of this research suggest that Video
Conferencing is one of the best tools for continuous updation of knowledge to medical
practitioners accompanied with the absence of any learning curve in a highly populous
country like India.
https://www.ijmst.com/
IJMST Volume 1 Issue 1, Manuscript 4
As the popularity of mobile devices and wireless networks significantly increased over the
past years. The wireless adhoc network has now become one of the most vibrant and active
fields of communication and networking research. These networks are a new generation of
networks offering unrestricted mobility without any underlying infrastructure. As their
principle application is in disastrous environments, security is critical. Various challenges are
faced in the adhoc environment, mostly due to the resource poorness of these networks. One
man confront in the design of these networks is their vulnerability to security attacks. The
solutions for conventional networks are usually not sufficient to provide efficient adhoc
operations. Just because of its wireless nature of communication and lack of any security
infrastructure raise several security problems and threats.
In this paper, we briefly review the threats an adhoc network faces and the security goals to
be achieved. Moreover, it also presents existing security schemes used in wireless adhoc
networks in order to handle security threats.
More from International Journal for management Science and Technology - https://www.ijmst.com/ (8)
Introduction to AI for Nonprofits with Tapp NetworkTechSoup
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
June 3, 2024 Anti-Semitism Letter Sent to MIT President Kornbluth and MIT Cor...Levi Shapiro
Letter from the Congress of the United States regarding Anti-Semitism sent June 3rd to MIT President Sally Kornbluth, MIT Corp Chair, Mark Gorenberg
Dear Dr. Kornbluth and Mr. Gorenberg,
The US House of Representatives is deeply concerned by ongoing and pervasive acts of antisemitic
harassment and intimidation at the Massachusetts Institute of Technology (MIT). Failing to act decisively to ensure a safe learning environment for all students would be a grave dereliction of your responsibilities as President of MIT and Chair of the MIT Corporation.
This Congress will not stand idly by and allow an environment hostile to Jewish students to persist. The House believes that your institution is in violation of Title VI of the Civil Rights Act, and the inability or
unwillingness to rectify this violation through action requires accountability.
Postsecondary education is a unique opportunity for students to learn and have their ideas and beliefs challenged. However, universities receiving hundreds of millions of federal funds annually have denied
students that opportunity and have been hijacked to become venues for the promotion of terrorism, antisemitic harassment and intimidation, unlawful encampments, and in some cases, assaults and riots.
The House of Representatives will not countenance the use of federal funds to indoctrinate students into hateful, antisemitic, anti-American supporters of terrorism. Investigations into campus antisemitism by the Committee on Education and the Workforce and the Committee on Ways and Means have been expanded into a Congress-wide probe across all relevant jurisdictions to address this national crisis. The undersigned Committees will conduct oversight into the use of federal funds at MIT and its learning environment under authorities granted to each Committee.
• The Committee on Education and the Workforce has been investigating your institution since December 7, 2023. The Committee has broad jurisdiction over postsecondary education, including its compliance with Title VI of the Civil Rights Act, campus safety concerns over disruptions to the learning environment, and the awarding of federal student aid under the Higher Education Act.
• The Committee on Oversight and Accountability is investigating the sources of funding and other support flowing to groups espousing pro-Hamas propaganda and engaged in antisemitic harassment and intimidation of students. The Committee on Oversight and Accountability is the principal oversight committee of the US House of Representatives and has broad authority to investigate “any matter” at “any time” under House Rule X.
• The Committee on Ways and Means has been investigating several universities since November 15, 2023, when the Committee held a hearing entitled From Ivory Towers to Dark Corners: Investigating the Nexus Between Antisemitism, Tax-Exempt Universities, and Terror Financing. The Committee followed the hearing with letters to those institutions on January 10, 202
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Normal Labour/ Stages of Labour/ Mechanism of LabourWasim Ak
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
Francesca Gottschalk - How can education support child empowerment.pptxEduSkills OECD
Francesca Gottschalk from the OECD’s Centre for Educational Research and Innovation presents at the Ask an Expert Webinar: How can education support child empowerment?
Honest Reviews of Tim Han LMA Course Program.pptxtimhan337
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
Development and Analysis of Transportation model in Public Distribution System (PDS) for Warangal district
1. Volume 1; Issue 2
Paper- 4
“Development and Analysis of Transportation model in
Public Distribution System (PDS) for
Warangal district”
www.ijmst.com April, 2013
International Journal for
Management Science
And
Technology (IJMST)
ISSN: 2320-8848 (Online)
ISSN: 2321-0362 (Print)
S. Srinivas
(India)
Research Scholar, Mechanical
Engineering Dept. NIT,
Warangal-506004
C.S.P.Rao
(India)
Professor, Mechanical
Engineering Dept. NIT,
Warangal-506004
N. Selvaraj
(India)
Professor, Mechanical
Engineering Dept. NIT,
Warangal-506004
2. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 2 April, 2013
Abstract
The main objective of this paper is to discuss Vehicle Routing Problem (VRP) for Public
Distribution System (PDS) including multi-depots, dispatching quantity, routes arrangement
and time-window constraints in order to reduce the delivering cost. The developed algorithm
first employs the heuristic search for feasible solutions based on the constraints of both the
time-window and loading capacity in the routing problem keeping the concept of nearest-
neighbor. Then the Best Case search algorithm is developed to select the best solutions
simultaneously to gain a optimal solution in the problem domain.
Keywords-Public Distribution System(PDS),Vehicle Routing Problem, Nearest Neighbour
Algorithm,
I. Introduction
The most popular scheme of Government of India to improve the lives of its citizens is the
Public Distribution System(PDS).Essential Commodities like rice, wheat, rice, sugar, oil etc
will be supplied at subsidized rates to its population through PDS. Union as well as state
governments spend thousands of crores of rupees through different schemes to improve the
lives of common men in the country. Even though there is an improvement in the lives of
citizens after independence, the magnitude of improvement is not matching the funds spent,
due to with diverse reasons. It can be avoided or minimized by proper delivery mechanism.
Public Distribution System (PDS) is a very important scheme for providing food security to
the poor and needy. The two important schemes of Government of India paddy procurement
at Minimum Support Price (MSP) and Public Distribution System (PDS) [1] cover the whole
food grain supply chain in the Country.
The Public Distribution System (PDS) in India evolved as a system of management of
scarcity and for distribution of food grains at affordable prices. PDS can be distinguished
from private distribution in terms of control exercised by public authority and the motive
being social welfare predominantly in contrast to private gain. Broadly the system includes
all the agencies that are involved from procurement stage to the final delivery of goods to the
consumer. The agency that is involved in the process of procurement, storage and distribution
is Food Corporation of India(FCI). Civil Supplies Department(CSD) and Civil Supplies
Corporation (CSC) and Fair Price Shops(FPS) are the agencies constituted in provision of
PDS. The FPS’s are the last link in this process, which are mostly owned by private
individuals. The network of PDS Supply chain is shown in figure 1. Hence, the most
important aspect that distinguishes PDS is the involvement of government agencies and
government control over the entire distribution system. The transportation starts from the
delivering rice from FCI owned godowns to Mandal Level Stock Point(MLSP) in the first
stage and again from MLSP to Fair Price Shop(FPS) in second stage as detailed in Figure-2.
3. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 3 April, 2013
Figure 1: Flow of Material in various stages of PDS
Working of System
The Civil Supplies Department (CSD) of district allocate the Quantity of goods to Fair Price
Shops(FPS) as per the no.of card holders and their eligibilities attached to FPS. The Civil
Supplies Corporation (CSC) supplies the goods to FPS through Mandal Level Stock Points
(MLSP) after receipt of Release order issued by CSD at respective MLSP’S and advance
payment by way of DD from FPS. The FPS distributes the goods to cardholders and pays
advance amounts to CSC by DD for release of stock for next month. There are 18 Mandal
level stock points (MLSP) which serve the total of 51 mandals in Warangal district of
Andhrapradesh State. In 51 mandals there are 2011 FPS. The monthly demand of the FPS is
served between 20th
-1st
of every month. The demand/supply of material is periodic, MLSP
received material from FCI owned godowns. There are 7 FCI owned godowns, located at
different locations. These FCI owned have huge amount of buffer as procurement of the
material (i.e. rice) from the millers is throughout the year in phases periodically. In the 1st
Stage materials moves from FCI godowns to Mandal level stock points in the 2nd
Stage
materials moves from Mandal level stock point to Fair Price Shops(FPS).All mandals and
MLSP are divided into five divisions due to administration.What has been explained is shown
in figure 2 through schematic representation.
Producers Warehouse FPS Consumers
s
Producers
Consumers
Producers Consumers
Warehouse
Warehouse
Warehouse
Warehouse
Network of
PDS
Supply
Chain
Procurement from
Producers by Central
Government Agencies
Warchouse in States
owned by central
agencies
Warchouses in
States owned by
State agencies
Distribution
through Fair
Price Shops
Different target
groups based on
State policy
FPS
FPS
Warehouse
Key Activities of
PDS Supply Chain
4. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 4 April, 2013
Figure 2: Working of System
It is necessary to enhance the efficiency in delivery of goods from FCI godowns to all
depots (FPS).Naturally delivery cost is key factor in the pricing of delivery services. To
reduce this cost research has tended to focus on the Vehicle Routing Problem (VRP) as a key
factor in delivery efficiency. The VRP is complex Non-deterministic Polynomial(NP-hard)
question As this is a large-scale problem, as things stand the best and most feasible way to
deal with it is to use a heuristic searching algorithm[3].
I.1.Litreature Review
The vehicle routing problem is a form of the Traveling Salesman’s Problem (TSP) which has
been popular since Dantzig and Ramser developed the idea in 1959. VRP has been one of the
basic models in network optimization problems. Researchers such as Su and Weng, Chang et
al., etc. have surveyed various meta-heuristic algorithms for solving TSP [6][7]. The Multi-
Depot Vehicle with a Time Window is one of the VRP extensions [4][5]. The objective of
this is usually to solve the VRP for a large region. The region is so widely spread that the
delivering cost is always tremendously high if only a single DC is in-charge of all deliveries.
In this work we have a scenario in which there are several middle level DC’s known as
MLSP which are in-charge of delivering all the demands of the depots (FPS), all of which are
required to be completed within given the Time Window. The VRP is the Multi-Depot
Vehicle Routing Problem with Time Window (MDVRPTW) problem.
I.2.Problem Statement
The objective of the research is usually to solve the VRP for a large region and apply the
same for Public Distribution System. The region is so widely spread that the delivering cost is
5. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 5 April, 2013
almost always tremendously high if only a single Distribution Centre (DC) is in charge of all
deliveries. It has been suggested that the best way to meet this problem is to set up district
DCs which enable the reduction of shipping cost. In this work, we have a scenario in which
PDS has set up several DCs(FCI owned godowns and MLSP) which are in charge of
delivering all of the shipping demands of all points(FPS) , all of which are required to be
completed within the time window of 10 days (i.e. every month 20th
-30th
). The VRP is the
Multi-Depot Vehicle Routing Problem with Time Window(MDVRPTW) problem. This work
proposes a hybrid heuristic approach to solve the MDVRPTW problem. It is proposed to
develop the transportation model for both the stages i.e model for movement from FCI
godowns to MLSP and from MLSP to depots(FPS). In the stage -1 Least cost algorithm[2] is
applied to assign nearest DC’s to FCI godowns. In the stage -2 the heuristic method is
applied which first employs the nearest-neighbor searching algorithm, starting from the initial
DC, and then assigns the nearest depots to the DC [8][9][10] . The initial solution plan is then
generated using this algorithm. Later this initial solution plan provided as input to best case
selection algorithm to minimize the transportation cost.
This work addresses an empirical multi-depot vehicle routing case for a fixed-route trucking
carrier. In this case, the characteristics of vehicle routing problems, including multi-depots,
dispatching quantity, loading capacity, routes arrangement and time-window constraints, are
considered in order to reduce the delivering cost.
2. Objectives
The primary objectives of this work are summarized as follows:
1. The research conducts a literature survey for the methodology used in route planning and
network analysis then serves as the foundation of network design and algorithm
development.
2. By constructing and analyzing the transportation network, it is proposed to develop a
search algorithm and to generate a feasible vehicle routing plan. The influencing factors
are to be identified, and then the mathematical formulation of the problem is to be
developed.
3. The sample data of the PDS is applied to validate the system in solving the routing
problem.
3. Methodology
3.1. Assumptions and Constraints
1. DC locations, shipping demand and destination locations are known.
2. Only one type of vehicle for cargo delivery in network. All vehicles have the same
loading capacity.
3. Shipping time is in proportion to the shipping distance, with no consideration of traffic
conditions.
4. All service vehicles have the same maintenance status. No breakdown or maintenance
issues are considered in the routing process.
The constraints of the problem include:
1. No repeat dispatching, a vehicle can only serve one route at a time.
2. All vehicles will complete all cargo shipments in compliance with the hard time-window
constraint.
6. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 6 April, 2013
3. The shipping demand of a depot cannot be divided. It should be delivered by the same
vehicle, unless the shipping demand of the depot exceeds the loading capacity of a
vehicle.
4. The time-window constraint is known. The driver will be given the time limitation so that
over-time driving can be eliminated.
5. The types and sizes of vehicles are known. This work does not consider driving with
additional “tail” containers.
6. The cargo loading cannot exceed the vehicle loading capacity at each delivery
3.2 Mathematical Model Formation
The objective is to minimize the overall transportation cost and total distance travelled [9].
The vehicles cannot deliver over the maximum loading capacity and working hours
STEP 1: Calculate the overall demand.
Demand of one MLSP is the summation of demands of all the mandals under that MLSP
Demand of one Mandal is the summation of demands of all FPS in that mandal.
Demand of one FPS is the summation of demands of all BPL cards of that shop.
STEP 2: Define objective function.
The objective of this research is to minimize the shipping costs, including loading/unloading
costs, fixed costs and variable costs of vehicles, while the vehicles cannot deliver over the
maximum loading capacity and working hours. The cost formulation and its relevant
notations are denoted as following:
N Set of all Depots, N= {1,2,3….n}
L Set of all DCs, L={1,2,3…l}
K Set of all vehicles, K = {1,2,3…k}
n Number of depots
l Number of DCs
k Number of vehicles
T The maximum working hours for vehicles
Q The maximum loading capacity of vehicles
cijl The shipping cost starting from DC, Depot i to Depot j
ai The shipping demand of Depot i
Si The service time
tij The delivery time from depot i to j
(i,j) Indicates the route from Depot i to j
bikl Starting from DC 1, the time needed for vehicle to deliver to Depot j
= 1 DC l, the vehicle k delivers cargo from i to j
= 0, Otherwise
The objective function:
Cost = ∑ Variable cost + ∑ fixed cost
In order to achieve an optimal plan, the objective function is minimized.
Cost = + (1)
7. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 7 April, 2013
Subject to:
=1 j=1,……,n (2)
<= 1 K = 1,….k (3)
<= Q K = 1,…..k (4)
= 0 or 1, i=0,……n ; j=0,……,n ; K= 1,2,…..,k ; L=1,2,…l (5)
Objective function (1) includes variable cost and fixed cost ( ). In order to
achieve an optimal plan, the objective function is minimized.
Constraint (2) states that the depot is the starting point for all shipments, which can be
served only by one vehicle at one time. If the shipping demand exceeds the vehicle
capacity, it must be delivered by another vehicle.
Constraint (3) states that one vehicle can only cover a route (i,j) one time at most.
Formula (4) is the constraint that the loading of each vehicle
( cannot exceed the loading capacity (Q).
represent the fixed cost for vehicle which includes salary for driver , road tax,
misc. expenditure, interest on cost of vehicle as 4,00,000/- @12% per annum per
month.
3.3 The Heuristic Algorithms
In order to solve this multi-depot vehicle routing problem with time-window, a hybrid
heuristic algorithm has been developed in which the solving process is divided into three
stages as shown in Figure 3. Based on the distances to the DCs, the first stage uses the
“cluster-first and route-second” principle to assign depots to specific DCs. In the second
stage, the nearest-neighbor searching algorithm is used to generate an initial routing plan
which assigns the vehicles and configures the routes used to deliver the cargo [9]. In final
stage, a Best case selection algorithm is used to fine tune the initial plan. The development of
the heuristic algorithms used in each of the three stages is further discussed below.
3.3.1 The Depot Assignment
The“cluster-first and route-second” method is used to calculate all distances from depots to a
DC. Then, the nearest depots are assigned to be served by the DC. This process does not stop
until all the depots are assigned to their nearest DCs. Therefore the multi-depot routing
problem can be simplified into several independent single-depot vehicle routing problems
8. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 8 April, 2013
Figure 3: The Hybrid heuristic algorithms
During the depot assignment task, a data processing task needs to be implemented to
determine if any possible direct shipment is possible based on the vehicle’s loading capacity:
if the shipping demand of one depot exceeds 80% of the vehicle’s maximum load, this
vehicle is used to directly deliver the cargo to its destination DC
Figure 4: The Cluster-first and route-second method.
9. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 9 April, 2013
Figure 4 shows the process of this algorithm. First, the distance is calculated from depots to
DCs. Depot 1 is closer to DC 1 than Depot 2 to DC 1,therefore Depot 1 is assigned to DC 1.
The process continues until the completion of all searches.
3.3.2 The Nearest Neighbor Searching Algorithm
As explained in the previous section, in stage1 depots are assigned to a DC. This means that,
the multi-depot vehicle routing problems have been simplified into several single-depot
vehicle routing problems. In formulation of objective function the multi-depot delivering cost
of is transformed into the cost of . The
formulation of the multi-depot problem is revised as shown in the following.
NNcost= + (6)
Subject to:
<= Q K = 1,…..k (7)
= 0 or 1, i=0,……n ; j=0,……,n ; K= 1,2,…..,k ; (8)
The new objective function (6) contains the variable cost, and the
fixed cost, .After the depot assignment process, the nearest-neighbor searching
algorithm is used to minimize the delivery cost, and subsequently generate the initial routing
plan. The algorithm arranges the nearest depot from the DC into the delivery route at the first
priority, i.e. the depot with the smallest NNcostis figured into the route first.
The searching process contains the following six steps, also shown in Figure 5.
1. mber all possible delivering nodes sequentially starting from 0, and calculate the
corresponding cost NN for each node.
2. Starting from a DC, assign the depot with the smallest cost NN as the first stop in the
delivery route.
3. Delete assigned depot, and search for the next stopping node with the minimum cost in
the rest of the nodes. The searching process continues while complying with
theconstraints and vehicle loading capacity.
4. Repeat Step 3 to build a new vehicle route from the DC until all the shipping demand
Of the DC are met.
5. Step 4 does not begin until there is no depot left for the DC.
6. Repeat Steps 2 to 5 to build a new route for another DC. The process will not terminate
until all shipping demands at DCs are delivered.
10. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 10 April, 2013
Figure 5 : The Nearest Neighbor Algorithm
3.3.3 Best Case Selection Algorithm
After the initial solution is generated, a Best Case Selection algorithm is developed to
implement the fine tuning task so as to get an improved routing plan. In this algorithm all
point on one route are arranged and all possible routes are generated for the initial
combination. Later distances are calculated for each route and best case i.e. route with least
distance is selected. The authors are preferred this algorithm because of limitation of truck
capacity to meet the demand of supply points to the extent of maximum 3-4 points in each
truck in initial solution .
4. Result And Discussion
4.1 Stage 1 solution
By using Least Cost Method we first get which Mandal Level Service Point (MLSP) is to be
served by which FCI owned godowns. Later the same is done by using CPLEX Solver 12.4.
In both the cases least distance travelled is calculated.
12. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 12 April, 2013
Table 5: Transportation Cost Comparison by Using different no. of Trucks for moving
from FCI to MLSP’S
Comparison of Transportation Cost
Using 1 Truck Using 2 Truck Using 3 Truck Using 4 Truck Using Best case
42927 56802 70677 84552 56802
101444 115319 129194 143069 143069
38341 52216 66091 79966 52216
56214 70089 83964 97839 83964
69870 83745 97620 111495 97620
19325 33200 47075 60950 33200
328121 411371 494621 577871 466871
The calculations in the above we hare made under the assumption that the fixed cost for each
truck is Rs. 13,875/-.
Table 6: Minimum transportation cost by using least no. of trucks within given time
window (30 days)
FCI owned
Godown
No. of vehicle
Fixed cost per
vehicle
Total fixed cost
(TFC)
Variable cost
(VC)
Total cost =
TFC+VC
1 2 13875 27750 29052 56802
2 4 13875 55500 87569 143069
3 2 13875 27750 24466 52216
4 3 13875 41625 42339 83964
5 3 13875 41625 55995 97620
6 2 13875 27750 5450 33200
466871
As per the above table the minimum transportation cost to move the goods from FCI
godowns to MLSP is Rs 4,66,872/- only
Figure 6: Comparison of Delivery Time Figure 7: Comparison of Transportation Cost
Using Least Cost Method Using Least Cost Method
14. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 14 April, 2013
Table 10: Minimum Trucks required at every FCI godowns
FCI owned
Godown
Delivery Time
using 1 truck
Delivery Time
using 2 truck
Delivery Time
using 3 truck
Minimum no. of truck to fulfill
demand in given time window
1 62 32 16 3
2 68 35 24 3
3 30 15 8 2
4 56 29 16 3
5 68 36 23 3
6 42 21 14 2
Assumed 6 days as safety period.
Table 11: Transportation Cost Comparison by Using different no. of Trucks for moving
From FCI to MLSP’S
Comparison of Transportation Cost
1 Truck 2 Truck 3 Truck Best Solution
46492 60367 74242 74242
82327 96202 110077 110077
38341 52216 66091 52216
56214 70089 83964 83964
69870 83745 97620 97620
34226 48101 61976 48101
The calculations in the above we have made under the assumption that the fixed cost for each
truck is Rs. 13,875/-.
Table 12: Minimum transportation cost by Using least no. of trucks within given time
window(30 days)
FCI owned
Godown
No. of vehicle
Fixed cost per
vehicle
Total fixed cost
(TFC)
Variable cost
(VC)
Total cost =
TFC+VC
1 3 13875 41625 32617 74242
2 3 13875 41625 68452 110077
3 2 13875 27750 24466 52216
4 3 13875 41625 42339 83964
5 3 13875 41625 55995 97620
6 2 13875 27750 20351 48101
466220
The minimum transportation cost to move the goods from FCI godowns to MLSP is
Rs4,66,220/- only.
15. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 15 April, 2013
Figure 8: Comparison of Delivery Time Figure 9: Comparison of Transportation
Cost
Using CPLEX Solver Using CPLEX Solver
4.1.3. Result generated by using minimum quoted tender values of Warangal district.
Table 13 Allocations of demands in Government provided Unit cost matrix
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Supply
1 129 129 141 165 198 239 256 279 209 275 239 209 175 222 320 199 184 224 88340
2 129 129 169 154 226 243 284 262 199 266 228 199 182 211 311 213 167 207 8500
3 129 129 169 154 226 243 284 262 199 266 228 199 182 211 311 213 167 207 10000
4 133 129 177 162 233 250 292 243 207 273 235 207 190 218 319 220 148 188 20000
5 196 207 141 186 129 203 175 360 235 301 301 292 256 305 404 264 267 307 30000
6 277 266 328 275 366 277 419 129 188 165 145 267 294 341 383 318 199 198 10000
7 129 129 163 148 220 237 277 256 194 260 222 194 177 205 305 207 162 201 2500
Demand
1622 1433 580.7 1196 731.2 642.3 8460 890.2 305.8 610.5 715.4 900 750 300 500 95 1097 305.4
The transportation cost to move the goods from FCI godowns to MLSP is Rs.2164311 by
taking consideration of rates paid by State government.
Rates fixed by State Government upto 16 km Rs129 per MT beyond 16 km Rs1.89 per MT
per km.
16. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 16 April, 2013
Figure 10: Cost Comparison by different Methods
Estimates transportation cost using Least Cost Method: Rs.4, 66,872
Estimates transportation cost using CPLEX12.4 solver: Rs.4, 66,220
Actual amount spent by Government for same quantity: Rs.21, 64,311
4.2 Stage 2 Solution
Step1: The “cluster first route second” method is used to calculate all distances from depots
to Distribution Center. By doing allocation of the different Mandals of Warangal District to
various MLSP, we convert the Multi-Depot Vehicle Routing Problem into collection of
separate and independent Single Depot Vehicle Routing Problem.
5.2.1 Allocation for Warangal Division
1 2 3 4 5 6 7 8 9 10 11 12 Supply
1 24 16 18 28 0 8 42 40 36 5 31 42 22000
2 21 20 14 32 5 11 39 36 33 0 27 47 10000
3 50 29 45 0 28 34 48 46 64 32 28 15 10000
4 47 21 12 28 42 15 36 33 30 47 0 38 7500
Demand 2652 3040 2626 3846 10126 3056 1798 2187 2341 11683 3015 1961
Figure 11: Showing allocations of Warangal Division
This means which mandal is to be served by which mandal level stock point. We can
conclude the result as
MLSP1 is assigned to fulfill the demand of Mandal 1,2,5,6,10
MLSP2 is assigned to fulfill the demand of Mandal 10
MLSP3 is assigned to fulfill the demand of Mandal 7,8,12
Similarly we can conclude all the results of allocation for different Divisions.
18. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 18 April, 2013
5.2.6 Demand at Narsampet MLSP is the summation of demands of mandals 45, 46, 48, 50,
51.
M.No
Name
of
the
Mandal
Total
BPL
Cards
Annapurna
(AAP)
Anthyodaya
(YAP)
White Cards (WAP)
Total
Cards
Rice
Quota
(In
Qtls)
Cards
Rice
Quota
(In
Qtls)
1M
2M
3M
4M
5M
and
more
Total
White
Cards
Rice
Quota
(In
Qtls)
NARSAMPET DIVISION
45 Chennaraopet 15559 50 5.00 1194 417.90 1184 2975 2976 4723 2457 14315 1888 2310.46
46 Duggondi 12869 38 3.80 990 346.90 941 2456 2482 3925 2037 11841 1565 1915.66
48 Khanapur 9263 37 3.70 854 298.90 679 1644 1853 2667 1529 8372 1112 1414.16
50 Nallabelly 11395 33 3.30 921 322.35 992 2134 2106 3402 1807 10441 1367 1692.49
51 Narsampet 17020 39 3.90 1349 472.15 1077 2647 3099 5559 3250 15632 2166 2642.21
Total 66106 197 20 5308 1858 4873 11856 12516 20276 11080 60601 8097 9975
Figure 16:Showing all particulars of Mandal under Narsampet MLSP.
5.2.7. Step2: Initial routes generated for Narsampet MLSP
Truck Average Speed = 200m/s
the truck loading time = 60
truck unloading time (0-25) = 20
truck unloading time (0-50) = 30
truck unloading time (0-75) = 40
truck unloading time (0-100) = 60
Total capacity of truck = 20 (in tonnes)
5.2.8. Final Results
Least _distance_travelled = 1690
Total time taken = 12473 Minutes
Total time taken = 208 Hours
Figure 17: Comparison of Delivery time in days for different truck load.
0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
0 1 2 3 4 5
Delivery
time
in
Days
No.of.Trucks
Comparison of delivery time for different truck loads
5
10
20
19. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 19 April, 2013
Figure 18: Comparison of Transportation Cost using Different type of truc
Figure 19: Statement of Different cost for trucks
Truck
capacity
Fixed cost
per truck
Fuel cost 1 truck 2 truck 3 truck 4 truck
5 13875 36628 50503 64378 78253 92128
10 13875 25655 39530 53405 67280 81155
20 13875 18950 32825 46700 60575 74450
Amount paid by Government is @ 6.5 per Quintal
Amount of Material moved is 9978 qtls.
Amount paid by Govt. per month for Narsampet MLSP = 64857.
So, if we use 20 ton truck then
Minimum no. of trucks required to ship the goods in given time window = 2
The Cost as per the algorithm per month = 46700
But the is no safety period
Taking 3 trucks of 20 Ton capacity
The Cost as per the algorithm per month = 60575
0
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
0 5 10 15 20
Transportation
cost
Thousands
Capacity of truck
Comparison of transport costs using different capacity of
trucks
1 truck
2 truck
3 truck
4 truck
20. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 20 April, 2013
Figure 20: Comparison of cost in stage I Figure 21: Comparison of cost for
for 1 MLSP under stage II
From the figure 20, it is known that Government expenditure for delivery of quantities per
month under stage –I is much more as compare to cost estimations by Algorithms developed.
And fig 21 shows the cost estimation for transportation of quantities from one MLSP to
retailers under that MLSP per month,the Government expenditure in Stage- II also more.
Hence the expenditure can be minimized by applying the techniques in the distribution of
PDS.
6. Conclusions:
This research has developed a transportation model with multi depot vehicle routing planning
that help engineers to solve the daily vehicle routing problems for a fixed –route trucking
carrier. The conclusion of this research is summarized as follows.
1. The multi-depot routing problem of the case company was formulated based on the
company’s current delivery network. A hybrid algorithm integrating the nearest-neighbor
searching algorithm and best case search algorithm is proposed to solve the routing problem.
The algorithm allows more precise estimation of loading capacity for each delivery route.
Therefore, the number of vehicles used in daily delivery tasks can be effectively estimated
and optimally arranged.
2. With the aid of computing technology, the time needed to generate a routing plan is
significantly reduced in comparison with time needed in the manual planning. The developed
system also helps to shorten the learning curve for new engineers in dealing with the routing
process. As a result the overall cost is reduced and possible loss due to poor routing plans is
avoided.
3. By the above research study it is observed that huge amounts spent on transportation of
PDS can be minimized and significant savings can be achieved by adoption of these supply
chain techniques in real life problems.
0
500000
1000000
1500000
2000000
2500000
1 2 3 4
Cost Comparasion under stage-
I
Government
Expenditure
Least Cost
Method
Algorithm
Ciplex
solvermethod
0
10000
20000
30000
40000
50000
60000
70000
1 2 3
Cost comparison under stage-II
at one MLSP
As per the
Alogorith
result
Government
Expenditure
21. International Journal for Management Science and Technology (IJMST)
Vol. 1; Issue 2
ISSN: 2320-8848(O.)/2321-0362(P.) Page 21 April, 2013
Refrences
Dr. Gyan Prakash IITM, Gwalior 2011 “Poor’s Supply Chain: Indian Public
Distribution System’’, January,7-8.
Dr.NVS RAJU 2009.From Operation Research 3rd
Revised Edition. New Delhi: SMS
Education.
Solomon, M.M., 1987, “Algorithms for the vehicle routing and scheduling problems
with time window constraints”, Operation Research,Vol.35,No.2,pp254-265.
Boldin, L.,Golden,B,Assa, A., and Ball,M,.1983 “Routing and Scheduling of
vehicles and crew,” Computers and Operation Research ,Vol. 10,No.2, pp. 63-211
Lang, M. X., 2006, “Study on the model and algorithm for multi-depot vehicle
scheduling problem,” Journal of Transportation Systems Engineering and Information
Technology, Vol.6, No. 5, pp. 65-69.
Su, C.T. and Weng, R.C.,2003,”Soving TSP problems by ant Colony optimization
and noising method,” Commerce and Management Quarterly,Vol.4,pp 359-375.
Fisher, M.L.,1995,”Vehicle routing,” In M.O.Ball, T.Maganti, C.Monma, and G.
Nemhauser (Eds),Hand book in Operation Research and Management
Science,Vol.8,pp.1-33.
Hwang, H. S., 2002, “An improved model for vehicle routing problem with time
constraint based on genetic algorithm,” Computers and Industrial Engineering, Vol.
42, pp. 361-369.
Shih, W. and Kun-Ou, Y., “The development of A web-based system to solve multi-
depot vehicle routing problem of fixed route trucks carriers.” International Journal of
Electronic Business Management, vol.5, No.4, pp.301-309(2007).
Solomon, M. M., 1987, “Algorithms for the vehicle routing and scheduling problems
with time window constraints,” Operations Research,Vol. 35, No. 2, pp. 254-265.