Layout design for the cross-docking centers is one of the strategic decision level and critical issue because of its directly effects on material flow efficiency in these areas. At this stage, the size and shapes of the cross-docking center have to be determined by taking into account material handling operations. In this study, the effects of the crossdock shapes on material handling cost from inbound doors to outbound doors are analyzed for different type of cross-docking center layouts. In this content, the shapes of I, L, T, and U for cross-docking centers are considered. In order to identify the best shape of the cross-docking centers, a mathematical model is formulated based on the truck-door assignment problem in cross-docking centers. In computational studies, the proposed mathematical model is performed for different sized problems considering the four building shapes and the best building shape is identified by comparing the total material handling costs.
HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Bas...IJECEIAES
In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig two costs, variable costs proportional to the amount shipped and fixed cost regardless of the quantity transported. To solve this kind of problem, metaheuristics and evolutionary methods should be applied. Genetic algorithms (GAs) seem to be one of such hopeful approaches which is based both on probability operators (Crossover and mutation) responsible for widen the solution space. The different characteristics of those operators influence on the performance and the quality of the genetic algorithm. In order to improve the performance of the GA to solve the FCTP, we propose a new adapted crossover operator called HOPX with the priority-based encoding by hybridizing the characteristics of the two most performent operators, the Order Crossover (OX) and Positionbased crossover (PX). Numerical results are presented and discussed for several instances showing the performance of the developed approach to obtain optimal solution in reduced time in comparison to GAs with other crossover operators.
Transportation is defined as the movement of passengers and freight from one place to another. Passenger is an important part of the overall development problem of the nation and it affects mostly all the aspects of mobility. The Transportation problem is one of the sub classes of LPP in which the objective is to transport various amount of a single homogeneous commodity, that are initially stored at various origins, to different destinations in such a way that the total transportation cost is minimum. Although the name of the problem is derived from transport to which it was first applied, the problem can also be used for machine allocation, plant location, product mix problem, and many others, so that the problem is not confined to transportation or distribution only. Data Envelopment Analysis (DEA) is a very powerful service management and benchmarking technique originally developed by Charnes et al (1) to evaluate nonprofit and public sector organizations. Linear programming problem (LPP) is the underlying methodology that makes DEA particularly powerful compared with alternative productivity management tools. A Transportation Problem can be solved very easily by different methods (NWC RULE, LCM & VAM) by recognizing and formulating into LPP. The IBFS obtained in Transportation Algorithm can be tested also by MODIFIED DISTRIBUTION METHOD. After studying this paper, we will be able to achieve the following objectives of Transportation System - a major problem of the metropolitan cities. 1- Recognize and formulate the transportation problem as a linear programming problem. 2- Build a transportation table and describe its components. 3- Find an initial basic feasible solution of the transportation problem by using various methods. 4- Know in detail all the steps involved in solving a transportation problem by MODI problem. 5- Solve the unbalanced transportation problems by MODI method. 6- Identify the special situation in transportation problems; such as degeneracy and alternative optimal solution. 7- Resolve the special cases in transportation problems, where the objective may be of maximization or some transportation route may be prohibited.
An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Pr...ijtsrd
An aggrandized solution is designed for the vehicles to reduce the total cost of distribution by which it can supply the goods to the customers with its known capacity can be named as a vehicle routing problem. In variable neighborhood search method, mainly an efficient vehicle routing can be achieved by calculating the distance matrix value based on the customers location or the path where the customers resides. The main objective of the paper is to reduce the total distance travelled to deliver the goods to the customers. The proposed algorithm is a hierarchy based enhanced agglomerative clustering algorithm technique which is used in the data mining scenario effectively. The proposed algorithm decreases the total distance assigning to each route and the important thing need to consider is that, this enhanced clustering algorithm can reduce the total distance when compared to the previously proposed variable neighborhood search method. V. Praveen | V. Hemalatha | M. Poovizhi"An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Problem" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd4701.pdf http://www.ijtsrd.com/computer-science/other/4701/an-enhanced-agglomerative-clustering-algorithm-for-solving-vehicle-routing-problem/v-praveen
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.
Formulation of a Combined Transportation and Inventory Optimization Model wit...IJERA Editor
Most distribution network design models existing in the literature have focused on minimizing the costs of
inventory and transportation. During the analysis of supply chain of currency management problem it is
observed that the transportation of currency from various sources to various destinations and the required
inventory to be maintained to meet the emerging demands requires formulation of a combined problem. This
framework aims to support the coordination of inventory and transportation activities to properly manage the
inventory profiles and currency flows between source locations and distribution centers. This paper considers a
multi-period inventory and transportation model for a single commodity. The key contribution of this paper is, a
mathematical programming formulation of transportation cum inventory problem is proposed and an algorithm
for this new formulation as a multi period decision process is intended. A numerical example of currency
transportation cum inventory is presented to illustrate the proposed algorithm.
Designing Unbalanced Assembly Lines: A Simulation Analysis to Evaluate Impact...IJERA Editor
This article investigates the impact of controlled imbalance levels on assembly lines, and its effects on two
important performance indicators: throughput and work in process (WIP) level. Using a five workstations line
simulation, with different degrees of imbalance and different configurations, we could conclude that there is a
relationship between extra capacity added to non-constraints and average WIP level and line throughput.
Simulation revealed that, using bowl shape configuration, the higher the imbalance, the higher the throughput,
with less WIP. These results allow proposing new studies to create a framework for evaluating the feasibility of
investments in extra capacity vis-a-vis those gains in resources efficiency.
Genetic Algorithm For The Travelling Salesman Problem using Enhanced Sequenti...CSCJournals
Traveling Salesman Problem (TSP) is one of the most important combinatorial optimization problems. There are many researches to improve the genetic algorithm for solving TSP. The Sequential Constructive crossover (SCX) is one of the most efficient crossover operators for solving optimization problems. In this paper, we propose a new crossover operator, named Enhanced Sequential Constructive crossover operator (ESCX), which modifies and improves the criteria of SCX operator in construction of offspring. ESCX considers, in addition to the real cost of the traversed cities, an estimation cost of the remaining tour, and it selects the next node to build the offspring based on that evaluation. The experimental results comparing the proposed crossover operator to the SCX operator on some benchmark TSPLIB instances show the effectiveness of our proposed operator.
HOPX Crossover Operator for the Fixed Charge Logistic Model with Priority Bas...IJECEIAES
In this paper, we are interested to an important Logistic problem modelised us optimization problem. It is the fixed charge transportation problem (FCTP) where the aim is to find the optimal solution which minimizes the objective function containig two costs, variable costs proportional to the amount shipped and fixed cost regardless of the quantity transported. To solve this kind of problem, metaheuristics and evolutionary methods should be applied. Genetic algorithms (GAs) seem to be one of such hopeful approaches which is based both on probability operators (Crossover and mutation) responsible for widen the solution space. The different characteristics of those operators influence on the performance and the quality of the genetic algorithm. In order to improve the performance of the GA to solve the FCTP, we propose a new adapted crossover operator called HOPX with the priority-based encoding by hybridizing the characteristics of the two most performent operators, the Order Crossover (OX) and Positionbased crossover (PX). Numerical results are presented and discussed for several instances showing the performance of the developed approach to obtain optimal solution in reduced time in comparison to GAs with other crossover operators.
Transportation is defined as the movement of passengers and freight from one place to another. Passenger is an important part of the overall development problem of the nation and it affects mostly all the aspects of mobility. The Transportation problem is one of the sub classes of LPP in which the objective is to transport various amount of a single homogeneous commodity, that are initially stored at various origins, to different destinations in such a way that the total transportation cost is minimum. Although the name of the problem is derived from transport to which it was first applied, the problem can also be used for machine allocation, plant location, product mix problem, and many others, so that the problem is not confined to transportation or distribution only. Data Envelopment Analysis (DEA) is a very powerful service management and benchmarking technique originally developed by Charnes et al (1) to evaluate nonprofit and public sector organizations. Linear programming problem (LPP) is the underlying methodology that makes DEA particularly powerful compared with alternative productivity management tools. A Transportation Problem can be solved very easily by different methods (NWC RULE, LCM & VAM) by recognizing and formulating into LPP. The IBFS obtained in Transportation Algorithm can be tested also by MODIFIED DISTRIBUTION METHOD. After studying this paper, we will be able to achieve the following objectives of Transportation System - a major problem of the metropolitan cities. 1- Recognize and formulate the transportation problem as a linear programming problem. 2- Build a transportation table and describe its components. 3- Find an initial basic feasible solution of the transportation problem by using various methods. 4- Know in detail all the steps involved in solving a transportation problem by MODI problem. 5- Solve the unbalanced transportation problems by MODI method. 6- Identify the special situation in transportation problems; such as degeneracy and alternative optimal solution. 7- Resolve the special cases in transportation problems, where the objective may be of maximization or some transportation route may be prohibited.
An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Pr...ijtsrd
An aggrandized solution is designed for the vehicles to reduce the total cost of distribution by which it can supply the goods to the customers with its known capacity can be named as a vehicle routing problem. In variable neighborhood search method, mainly an efficient vehicle routing can be achieved by calculating the distance matrix value based on the customers location or the path where the customers resides. The main objective of the paper is to reduce the total distance travelled to deliver the goods to the customers. The proposed algorithm is a hierarchy based enhanced agglomerative clustering algorithm technique which is used in the data mining scenario effectively. The proposed algorithm decreases the total distance assigning to each route and the important thing need to consider is that, this enhanced clustering algorithm can reduce the total distance when compared to the previously proposed variable neighborhood search method. V. Praveen | V. Hemalatha | M. Poovizhi"An Enhanced Agglomerative Clustering Algorithm for Solving Vehicle Routing Problem" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd4701.pdf http://www.ijtsrd.com/computer-science/other/4701/an-enhanced-agglomerative-clustering-algorithm-for-solving-vehicle-routing-problem/v-praveen
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.
Formulation of a Combined Transportation and Inventory Optimization Model wit...IJERA Editor
Most distribution network design models existing in the literature have focused on minimizing the costs of
inventory and transportation. During the analysis of supply chain of currency management problem it is
observed that the transportation of currency from various sources to various destinations and the required
inventory to be maintained to meet the emerging demands requires formulation of a combined problem. This
framework aims to support the coordination of inventory and transportation activities to properly manage the
inventory profiles and currency flows between source locations and distribution centers. This paper considers a
multi-period inventory and transportation model for a single commodity. The key contribution of this paper is, a
mathematical programming formulation of transportation cum inventory problem is proposed and an algorithm
for this new formulation as a multi period decision process is intended. A numerical example of currency
transportation cum inventory is presented to illustrate the proposed algorithm.
Designing Unbalanced Assembly Lines: A Simulation Analysis to Evaluate Impact...IJERA Editor
This article investigates the impact of controlled imbalance levels on assembly lines, and its effects on two
important performance indicators: throughput and work in process (WIP) level. Using a five workstations line
simulation, with different degrees of imbalance and different configurations, we could conclude that there is a
relationship between extra capacity added to non-constraints and average WIP level and line throughput.
Simulation revealed that, using bowl shape configuration, the higher the imbalance, the higher the throughput,
with less WIP. These results allow proposing new studies to create a framework for evaluating the feasibility of
investments in extra capacity vis-a-vis those gains in resources efficiency.
Genetic Algorithm For The Travelling Salesman Problem using Enhanced Sequenti...CSCJournals
Traveling Salesman Problem (TSP) is one of the most important combinatorial optimization problems. There are many researches to improve the genetic algorithm for solving TSP. The Sequential Constructive crossover (SCX) is one of the most efficient crossover operators for solving optimization problems. In this paper, we propose a new crossover operator, named Enhanced Sequential Constructive crossover operator (ESCX), which modifies and improves the criteria of SCX operator in construction of offspring. ESCX considers, in addition to the real cost of the traversed cities, an estimation cost of the remaining tour, and it selects the next node to build the offspring based on that evaluation. The experimental results comparing the proposed crossover operator to the SCX operator on some benchmark TSPLIB instances show the effectiveness of our proposed operator.
On The Use of Transportation Techniques to Determine the Cost of Transporting...IOSR Journals
This paper aims at identifying an effective and appropriate method of calculating the cost of transporting goods from several supply centers to several demand centers out of many available methods. Transportation algorithms of North-West corner method (NWCM), Least Cost Method (LCM), Vogel’s Approximation Method (VAM) and Optimality Test were carried out to estimate the cost of transporting produced newspaper from production center to ware-houses using Statistical software called TORA. The results revealed that: NWCM = 36,689,050.00, LCM = 55,250,034.00, VAM = 29,097,700.00 and Optimal solution = 19,566,332.00. It was discovered that Vogel’s Approximation method gives the transportation cost that closer to optimal solution. Also, the study revealed that a production center should be created at northern part of Nigeria to replace the dummy supply center used in the analysis, so as to make production capacity equal to requirement.
CONTAINER TRAFFIC PROJECTIONS USING AHP MODEL IN SELECTING REGIONAL TRANSHIPM...IAEME Publication
Shipping is a major link between the global economy and international trade. More than 90% of world merchandise trade is carried by sea and over 60% of that volume is containerized. The increasing number of container shipments causes higher demands on the seaport container terminals, container logistics and management as well as on technical equipment. In the Asian region, the existence of ports such as Singapore and trade evolving from developing countries makes it one of the busiest container sea routes in the world. The average vessel size registered in 2008 was approx 3400 TEU’s as against 2500 TEU’s in 2001.
Transportation Problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving Triangular fuzzy numbers for the transportation costs and values of supplies and demands. We propose a two-step method for solving fuzzy transportation problem where all of the parameters are represented by non-negative triangular fuzzy numbers i.e., an Interval Transportation Problems (TPIn) and a Classical Transport Problem (TP). Since the proposed approach is based on classical approach it is very easy to understand and to apply on real life transportation problems for the decision makers. To illustrate the proposed approach two application examples are solved. The results show that the proposed method is simpler and computationally more efficient than existing methods in the literature.
A STUDY ON MULTI STAGE MULTIOBJECTIVE TRANSPORTATION PROBLEM UNDER UNCERTAINT...IAEME Publication
In present scenario due to high competition in market, there are lots of pressures on
organizations involbs with transportation industry, to provide the service in a better
and effective manner. The distribution of products among the customers in systematic
manner is not an easy task. Transportation models provide an effective framework to
meet these challenges. In an uncertainty environment, it is a too difficult to handle a
multi-objective transportation problem with fixed parameters, rather it is easy to
consider all related factors in terms of linguistic parameters. Different objectives of a
multi-objective transportation problem are affected by multiple numbers of criteria like
route of transportation, weather condition, vehicles used for transportation etc.
In this study a multi-stage multi-objective transportation model is developed with
fuzzy relations. Minimization of both cost and time of transportation are considered as
two different objectives of first stage which are associated with a number of different
criteria like detortion time, fixed charge and mode of transportation. In second stage,
another objective i.e quantity of transported amount is considered on the basis of
previous two objectives. All these factors considered for this model are imprecise in
nature and are represented in terms of linguistic variables. The fuzzy rule based multiobjective
transportation problem is formulated and Genetic Algorithm for multiobjective
problems (MOGA) is used to find optimal solution. The model is presented
with a numerical problem and optimum result is discussed.
Plant location selection by using MCDM methodsIJERA Editor
Plant location selection has a critical impact on the performance of manufacturing companies. The cost associated with acquiring the land and facility construction makes the location selection a long-term investment decision. The preeminent location is that which results in higher economic benefits through increased productivity and good distribution network. Both potential qualitative and quantitative criteria’s are to be considered for selecting the proper plant location from a given set of alternatives. Consequently, from the literature survey, it is found that the Multi criteria decision-making (MCDM) is found to be an effective approach to solve the location selection problems. In the present research, an integrated decision-making methodology is designed which employs the two well-known decision making techniques, namely Analytical hierarchy process (AHP), and Preference ranking organization method for enrichment evaluations (PROMETHEE-II) in order to make the best use of information available, either implicitly or explicitly. It is analyze the structure for the solution of plant location problems and to obtain weights of the selected criteria’s. PROMETHEE-II is employed to solve decision-making problems with multiple conflicting criteria and alternatives.
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.
International Journal of Business and Management Invention (IJBMI)inventionjournals
International Journal of Business and Management Invention (IJBMI) is an international journal intended for professionals and researchers in all fields of Business and Management. IJBMI publishes research articles and reviews within the whole field Business and Management, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online
The selection of third party logistics (TPL) providers is an important issue for enterprises to
outsource their logistics business. In this paper we propose a comprehensive evaluation model for TPL
suppliers based on AHP method. Furthermore, we Base on the evaluation index system including logistics cost,
the logistics operation efficiency and the basic qualities of service. The efficiency and application of the
proposed approach has been illustrated with a case study in Emergency Department of Sfax hospital
Optimizing Waste Collection In An Organized Industrial Region: A Case Studyertekg
Download Link > https://ertekprojects.com/gurdal-ertek-publications/blog/optimizing-waste-collection-in-an-organized-industrial-region-a-case-study/
In this paper we present a case study which involves the design of a supply chain network for industrial waste collection. The problem is to transport metal waste from 17 factories to containers and from containers to a disposal center (DC) at an organized region of automobile parts suppliers. We applied the classic mixed-integer programming (MIP) model for the two-stage supply chain to the solution of this problem. The visualization of the optimal solution provided us with several interesting insights that would not be easily discovered otherwise.
To Analyze Cargo Loading Optimization AlgorithmShahzad
To analyze and plan software development for Cargo Loading optimization module in Flight Cargo of PCMS, Pegasus Cargo Management System.
1. To Study industry available software for Cargo Load optimization and planning.
2. To study the available algorithm for Cargo Loading optimization in Flight Cargo module of PCMS, Pegasus Cargo Management System.
3. To analyze requirement specification for Cargo Load optimization and planning
A new hybrid approach for solving travelling salesman problem using ordered c...eSAT Journals
Abstract Travelling Salesman Problem is a well known NP problem. It is an optimization problem. Genetic Algorithms are the evolution techniques to solve optimization problems. In this paper a new hybrid technique using ordered cross over 1 (OX1) and greedy approach has been proposed. Experiment results shows that the proposed hybrid cross over is better than the existing cross over operator as the new operator provide a better path when executed for the same number of iterations. Keywords:- Travelling Salesman Problem, ordered cross over 1 (OX1)
Enhanced Secret Communication Using Multilevel Audio Steganographyijceronline
The paper presents multilevel audio Steganography, which describes a new model for hidden communication in secret communication technology. In multilevel Steganography, at least two embedding methods are used in such a way that the second method will use the first method as a carrier. This approach has several potential benefits in hidden communication. It can be used to increase the level of security while transmitting the confidential information over public channels or internet. It can also be used to provide two or more information hiding solutions simultaneously. Another important advantage is that the lower-level embedding / extracting method and upper-level embedding / extracting method are interrelated in terms of functionality and this makes the hidden communication harder to detect. If the cover object is decoded by any adversary, he/she only obtains a decoy message or a partial message. The performance of the proposed scheme in terms of imperceptibility, capacity & security is measured through different experiments and results are included in this paper
On The Use of Transportation Techniques to Determine the Cost of Transporting...IOSR Journals
This paper aims at identifying an effective and appropriate method of calculating the cost of transporting goods from several supply centers to several demand centers out of many available methods. Transportation algorithms of North-West corner method (NWCM), Least Cost Method (LCM), Vogel’s Approximation Method (VAM) and Optimality Test were carried out to estimate the cost of transporting produced newspaper from production center to ware-houses using Statistical software called TORA. The results revealed that: NWCM = 36,689,050.00, LCM = 55,250,034.00, VAM = 29,097,700.00 and Optimal solution = 19,566,332.00. It was discovered that Vogel’s Approximation method gives the transportation cost that closer to optimal solution. Also, the study revealed that a production center should be created at northern part of Nigeria to replace the dummy supply center used in the analysis, so as to make production capacity equal to requirement.
CONTAINER TRAFFIC PROJECTIONS USING AHP MODEL IN SELECTING REGIONAL TRANSHIPM...IAEME Publication
Shipping is a major link between the global economy and international trade. More than 90% of world merchandise trade is carried by sea and over 60% of that volume is containerized. The increasing number of container shipments causes higher demands on the seaport container terminals, container logistics and management as well as on technical equipment. In the Asian region, the existence of ports such as Singapore and trade evolving from developing countries makes it one of the busiest container sea routes in the world. The average vessel size registered in 2008 was approx 3400 TEU’s as against 2500 TEU’s in 2001.
Transportation Problem (TP) is an important network structured linear programming problem that arises in several contexts and has deservedly received a great deal of attention in the literature. The central concept in this problem is to find the least total transportation cost of a commodity in order to satisfy demands at destinations using available supplies at origins in a crisp environment. In real life situations, the decision maker may not be sure about the precise values of the coefficients belonging to the transportation problem. The aim of this paper is to introduce a formulation of TP involving Triangular fuzzy numbers for the transportation costs and values of supplies and demands. We propose a two-step method for solving fuzzy transportation problem where all of the parameters are represented by non-negative triangular fuzzy numbers i.e., an Interval Transportation Problems (TPIn) and a Classical Transport Problem (TP). Since the proposed approach is based on classical approach it is very easy to understand and to apply on real life transportation problems for the decision makers. To illustrate the proposed approach two application examples are solved. The results show that the proposed method is simpler and computationally more efficient than existing methods in the literature.
A STUDY ON MULTI STAGE MULTIOBJECTIVE TRANSPORTATION PROBLEM UNDER UNCERTAINT...IAEME Publication
In present scenario due to high competition in market, there are lots of pressures on
organizations involbs with transportation industry, to provide the service in a better
and effective manner. The distribution of products among the customers in systematic
manner is not an easy task. Transportation models provide an effective framework to
meet these challenges. In an uncertainty environment, it is a too difficult to handle a
multi-objective transportation problem with fixed parameters, rather it is easy to
consider all related factors in terms of linguistic parameters. Different objectives of a
multi-objective transportation problem are affected by multiple numbers of criteria like
route of transportation, weather condition, vehicles used for transportation etc.
In this study a multi-stage multi-objective transportation model is developed with
fuzzy relations. Minimization of both cost and time of transportation are considered as
two different objectives of first stage which are associated with a number of different
criteria like detortion time, fixed charge and mode of transportation. In second stage,
another objective i.e quantity of transported amount is considered on the basis of
previous two objectives. All these factors considered for this model are imprecise in
nature and are represented in terms of linguistic variables. The fuzzy rule based multiobjective
transportation problem is formulated and Genetic Algorithm for multiobjective
problems (MOGA) is used to find optimal solution. The model is presented
with a numerical problem and optimum result is discussed.
Plant location selection by using MCDM methodsIJERA Editor
Plant location selection has a critical impact on the performance of manufacturing companies. The cost associated with acquiring the land and facility construction makes the location selection a long-term investment decision. The preeminent location is that which results in higher economic benefits through increased productivity and good distribution network. Both potential qualitative and quantitative criteria’s are to be considered for selecting the proper plant location from a given set of alternatives. Consequently, from the literature survey, it is found that the Multi criteria decision-making (MCDM) is found to be an effective approach to solve the location selection problems. In the present research, an integrated decision-making methodology is designed which employs the two well-known decision making techniques, namely Analytical hierarchy process (AHP), and Preference ranking organization method for enrichment evaluations (PROMETHEE-II) in order to make the best use of information available, either implicitly or explicitly. It is analyze the structure for the solution of plant location problems and to obtain weights of the selected criteria’s. PROMETHEE-II is employed to solve decision-making problems with multiple conflicting criteria and alternatives.
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.
International Journal of Business and Management Invention (IJBMI)inventionjournals
International Journal of Business and Management Invention (IJBMI) is an international journal intended for professionals and researchers in all fields of Business and Management. IJBMI publishes research articles and reviews within the whole field Business and Management, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online
The selection of third party logistics (TPL) providers is an important issue for enterprises to
outsource their logistics business. In this paper we propose a comprehensive evaluation model for TPL
suppliers based on AHP method. Furthermore, we Base on the evaluation index system including logistics cost,
the logistics operation efficiency and the basic qualities of service. The efficiency and application of the
proposed approach has been illustrated with a case study in Emergency Department of Sfax hospital
Optimizing Waste Collection In An Organized Industrial Region: A Case Studyertekg
Download Link > https://ertekprojects.com/gurdal-ertek-publications/blog/optimizing-waste-collection-in-an-organized-industrial-region-a-case-study/
In this paper we present a case study which involves the design of a supply chain network for industrial waste collection. The problem is to transport metal waste from 17 factories to containers and from containers to a disposal center (DC) at an organized region of automobile parts suppliers. We applied the classic mixed-integer programming (MIP) model for the two-stage supply chain to the solution of this problem. The visualization of the optimal solution provided us with several interesting insights that would not be easily discovered otherwise.
To Analyze Cargo Loading Optimization AlgorithmShahzad
To analyze and plan software development for Cargo Loading optimization module in Flight Cargo of PCMS, Pegasus Cargo Management System.
1. To Study industry available software for Cargo Load optimization and planning.
2. To study the available algorithm for Cargo Loading optimization in Flight Cargo module of PCMS, Pegasus Cargo Management System.
3. To analyze requirement specification for Cargo Load optimization and planning
A new hybrid approach for solving travelling salesman problem using ordered c...eSAT Journals
Abstract Travelling Salesman Problem is a well known NP problem. It is an optimization problem. Genetic Algorithms are the evolution techniques to solve optimization problems. In this paper a new hybrid technique using ordered cross over 1 (OX1) and greedy approach has been proposed. Experiment results shows that the proposed hybrid cross over is better than the existing cross over operator as the new operator provide a better path when executed for the same number of iterations. Keywords:- Travelling Salesman Problem, ordered cross over 1 (OX1)
Enhanced Secret Communication Using Multilevel Audio Steganographyijceronline
The paper presents multilevel audio Steganography, which describes a new model for hidden communication in secret communication technology. In multilevel Steganography, at least two embedding methods are used in such a way that the second method will use the first method as a carrier. This approach has several potential benefits in hidden communication. It can be used to increase the level of security while transmitting the confidential information over public channels or internet. It can also be used to provide two or more information hiding solutions simultaneously. Another important advantage is that the lower-level embedding / extracting method and upper-level embedding / extracting method are interrelated in terms of functionality and this makes the hidden communication harder to detect. If the cover object is decoded by any adversary, he/she only obtains a decoy message or a partial message. The performance of the proposed scheme in terms of imperceptibility, capacity & security is measured through different experiments and results are included in this paper
Study on M/M/2 Transient Queue with Feedback under Catastrophic Effectijceronline
In this paper we study the time dependent solution of feedback customer with two servers along with catastrophic effect. We derive the asymptotic behavior of the queue length and the stationary probability distributions. The numerical examples are also given to test the effectiveness of the queue length under the catastropic conditions
Эволюция управления требованиями в ЖЦ информационной системыEvgeny Savitsky
Процесс управления требованиями меняется в зависимости от стадии жизненного цикла продукта. В начале, когда нет требований лучше использовать легковесные практики, например, Scrum и User Story. По мере развития продукта необходимо документировать требования и принятые технические решения. Таким образом, на этапе эксплуатации и поддержки продукта вы сможете организовать процесс разработки основанный на требованиях и добиться высокой эффективности и качества при внесении изменений.
Analysis and Design of Information Systems Financial Reports with Object Orie...ijceronline
Micro, Small and Medium Enterprises (SMEs) are a group effort proved resistant to a wide range of economic crisis shocks. But in the operation of their business financial management is still not transparent and are also still mixed between business finance and personal finance. So that needs to be done with good financial management. In this research, analysis and information system design financial reports as a basis for the development of the system. Software development life cycle (SDLC) using the model of the object oriented approach. With object-oriented approach, the tools used by the notation Unified Modelling Language (UML). In object-oriented approach all systems applications are Viewed as a collection of objects that allow organisasi interloking and end users to Easily understand logical entities. Object-oriented approach Provides the benefits of the reuse of codes and saves the time for developing quality product.
Centralized System in MANET with GRP Protocolijceronline
A MANET is an autonomous collection of mobile users that communicate over relatively bandwidth constrained wireless links. Since the nodes are mobile, the network topology may change rapidly and unpredictably over time. The network is decentralized, where all network activity including discovering the topology and delivering messages must be executed by the nodes themselves, i.e., routing functionality will be incorporated into mobile nodes.. In this paper routing protocols GRP for mobile ad hoc network with centralized system is checked to know the performance of the network. We will see that, is their any change in the performance of the network if will deploy centralized system in MANET.
Time-Cost Trade-Off Analysis in a Construction Project Problem: Case Studyijceronline
In construction project, cost and time reduction is crucial in today’s competitive market respect. Cost and time along with quality of the project play vital role in construction project’s decision. Reduction in cost and time of projects has increased the demand of construction project in the recent years. Trade-off between different conflicting aspects of projects is one of the challenging problems often faced by construction companies. Time, cost and quality of project delivery are the important aspects of each project which lead researchers in developing time-cost trade-off model. These models are serving as important management tool for overcoming the limitation of critical path methods frequently used by company. The objective of time-cost trade-off analysis is to reduce the original project duration with possible least total cost. In this paper critical path method with a heuristic method is used to find out the crash durations and crash costs. A regression analysis is performed to identify the relationship between the times and costs in order to formulize an optimization problem model. The problem is then solved by Matlab program which yields a least cost of $60937 with duration 129.50 ≈130 days. Applying this approach, the result obtained is satisfactory, which is an indication of usefulness of this approach in construction project problems.
Solitons Solutions to Some Evolution Equations by ExtendedTan-Cot Methodijceronline
The proposed extended Tan-Cot method is applied to obtain new exact travelling wave solutions to evolution equation. The method is applicable to a large variety of nonlinear partial differential equations, the Fifth-order nonlinear integrable equation, the symmetric regularized long wave equation, the higher-order wave equation of Kdv type, and Benney-Luke equation. The Extended Tan-Cot method seems to be powerful tool in dealing with nonlinear physical models
THE RESEARCH AND IMPLEMENTATION OF PASSENGER CAR'S TRANSPORTATION PLANNING PR...ijcseit
In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the transportation company, and to provide general program for transportation planning, the blanking model of solving the loading problem is established .First by giving the load model of single-deck and single-row
car, then established the blanking model for the decision variables by taking model number, so that can solve the problem of arbitrary loading values. The numerical calculation of blanking model has discussed specially, and by making corresponding program, the loading plan of passenger car that to solve the problem has been given.
THE RESEARCH AND IMPLEMENTATION OF PASSENGER CAR'S TRANSPORTATION PLANNING PR...cseij
In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the
transportation company, and to provide general program for transportation planning, the blanking model
of solving the loading problem is established .First by giving the load model of single-deck and single-row
car, then established the blanking model for the decision variables by taking model number, so that can
solve the problem of arbitrary loading values.
In order to solve the problem of providing a detailed plan of passenger car's loading scheme for the transportation company, and to provide general program for transportation planning, the blanking model of solving the loading problem is established .First by giving the load model of single-deck and single-row car, then established the blanking model for the decision variables by taking model number, so that can solve the problem of arbitrary loading values. The numerical calculation of blanking model has discussed specially, and by making corresponding program, the loading plan of passenger car that to solve the problem has been given.
International Journal of Research in Engineering and Science is an open access peer-reviewed international forum for scientists involved in research to publish quality and refereed papers. Papers reporting original research or experimentally proved review work are welcome. Papers for publication are selected through peer review to ensure originality, relevance, and readability.
Vehicle routing problem is a NP-hard problem, with the expansion of problem solving more difficult.
This paper proposes a hybrid behavior based on ant colony algorithm to solve the problem, ant to different
objectives in the first place as the path selection according to the analysis of the impact on the algorithm, then
define the ant behavior and design four concrete ant behavior by selecting different ways of ant behavior to
form different improved algorithm. Finally, experimental results show that the improved algorithm can solve
vehicle routing problems quickly and effectively.
A Combined Method for Capacitated Periodic Vehicle Routing Problem with Stric...rahulmonikasharma
The paper develops a model for the optimal management of periodic deliveries of a given commodity with known capacity called Capacitated Periodic Vehicle Routing Problem (CPVRP). Due to the large number of customers, it is necessary to incorporate strict time windows, and pick-up and delivery in the periodic planning.. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the the routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We model the problem as a large-scale linear mixed integer program and we propose a combined approach to solve the problem.
Vehicle route scheduling and transportation cost minimization in a latex indu...IJRES Journal
The vehicle route scheduling problem is concerned with the determination of routes and schedules for a fleet of vehicles to satisfy the demands of a set of customers. The goal of vehicle routing is to schedule multiple suppliers from various places. Vehicle routing has existed since the advent of the Industrial age, when large-scale production became possible. As the complexity and scale of the manufacturing world increased, the task of optimizing vehicle routing grew. The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. Often the context is that of delivering goods located at a central depot to customers who have placed orders for such goods or vice-versa. Implicit is the goal of minimizing the cost of distributing the goods. Many methods have been developed for searching for good solutions to the problem, however even for the smallest problems, finding global minimum for the cost function is computationally complex. The paper presents an optimization algorithm using Particle Swarm Optimization (PSO) for the vehicle routing that would enable the logistic manager of a latex industry to minimize the transportation cost and maximize the collection using minimum number of vehicles.
T HE PASSENGER VEHICLE ' S LOGISTICS TRANSPORTATION PLANNING PROBLEM BASED O...ijcsa
In order to solve the heterogeneous vehicle routing
problem with two-dimensional loading constraint, a
n
integer programming model of the heterogeneous vehi
cle's routing problem has been founded. To optimize
the loading way of the 45 kind of passenger car by
quantum genetic algorithm (QGA), firstly the QGA is
adopted to get the assemble of each passenger car,
then analysis the routing problem of the each car-
carrier. The optimization of integer programming pr
oblems and the simulation and application of QGA ar
e
discussed specifically.
Conflict-free dynamic route multi-agv using dijkstra Floyd-warshall hybrid a...IJECEIAES
Autonomous Guided Vehicle is a mobile robot that can move autonomously on a route or lane in an indoor or outdoor environment while performing a series of tasks. Determination of the shortest route on an autonomous guided vehicle is one of the optimization problems in handling conflict- free routes that have an influence on the distribution of goods in the manufacturing industry's warehouse. Pickup and delivery processes in the distribution on AGV goods such as scheduling, shipping, and determining the route of vehicle with short mileage characteristics, is very possible to do simulations with three AGV units. There is a windows time limit on workstations that limits shipping. The problem of determining the route in this study is considered necessary as a multi-vehicle route problem with a time window. This study aims to describe the combination of algorithms written based on dynamic programming to overcome the problem of conflict-free AGV routes using time windows. The combined approach of the Dijkstra and Floyd-Warshall algorithm results in the optimization of the closest distance in overcoming conflict-free routes.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Student information management system project report ii.pdf
The Effects of Crossdock Shapes on Material Handling Costs
1. ISSN (e): 2250 – 3005 || Volume, 06 || Issue, 10 || October – 2016 ||
International Journal of Computational Engineering Research (IJCER)
www.ijceronline.com Open Access Journal Page 1
The Effects of Crossdock Shapes on Material Handling Costs
İlker Küçükoğlu1
1
Uludag UniversityFaculty of Engineering, Industrial Engineering Department, Gorukle Campus, 16059, Bursa,
Turkey
I. INTRODUCTION
The efficiency of transportation is one of the most important factor for supply chain management. For this
reason, many companies develop various strategies to boost customer satisfaction and bring down the total
costs. Cross-docking is one of these strategy and has a great potential to bring considerable reduction in the
distribution cost by eliminating the redundant storage [1, 2].
The cross-docking system can be described as the process of moving products from suppliers to customers
through cross-docking centers without storing products for a long time. In the cross-docking network, the
products are unloaded from incoming trucks at inbound doors and consolidated according to their destination.
After the consolidation operations products are reloaded to outgoing trucks at outbound doors for distribution. In
short term decision level of the cross-docking system, the operational plans such as transportation, truck-door
assignment, consolidation, product placement, scheduling, etc. play an important role to increase efficiency of
the system [3, 4]. In order to minimize total material handling costs in cross-docking centers, this study
considers the truck-door assignment problem of cross-docking system with product placement operations which
is called as truck-door assignment and product placement problem in cross-docking center. The truck-door
assignment problem in cross-docking centers can be described as finding the optimal assignment plan of
incoming and outgoing trucks to inbound and outbound doors, respectively [1, 4, 5].
The earliest study for the truck-door assignment problem is presented by Tsui and Chang [6] where a bilinear
program is proposed for assigning the origins and destinations to dock doors. The authors also proposed a
simple heuristic approach to solve problem. The same authors later proposed an improved version of the
heuristic approach [7]. Bartz-Beielstein et al. [8] developed a model which is derived from real freight
forwarder’s data and solved by using an evolutionary multi-objective algorithm. Cohen and Keren [9] expanded
the truck-door assignment problem by allowing the freight splitting for capacitated trailers and proposed a
heuristic algorithm to solve problem. Oh et al. [10] considered the truck-door assignment problem for a real life
case of a mail distribution center. The problem is formulated as a non-linear mathematical model and solved by
two heuristic methods proposed by the authors. Bozer and Carlo [11] studied the static and dynamic truck-door
assignment problem, in which the outbound doors are fixed over the planning horizon for static door assignment
problem while the assignment plans are re-formed every day for dynamic doors assignment problem. The static
truck-door assignment problem is also taken into account by Yu et al. [12]. The authors developed two heuristic
methods which provide approximately 20% reduction in man-hour requirements. Miao et al. [13] considered the
truck-door assignment problem with operational time constraints and proposed a tabu search and a genetic
algorithm for the problem. Stephan and Boysen [14] compared the assignment policy of the trucks to the doors
and they showed that the mix policy is better than the fixed policy for most of the cases. Luo and Noble [15]
ABSTRACT
Layout design for the cross-docking centers is one of the strategic decision level and critical issue
because of its directly effects on material flow efficiency in these areas. At this stage, the size and
shapes of the cross-docking center have to be determined by taking into account material handling
operations. In this study, the effects of the crossdock shapes on material handling cost from inbound
doors to outbound doors are analyzed for different type of cross-docking center layouts. In this
content, the shapes of I, L, T, and U for cross-docking centers are considered. In order to identify the
best shape of the cross-docking centers, a mathematical model is formulated based on the truck-door
assignment problem in cross-docking centers. In computational studies, the proposed mathematical
model is performed for different sized problems considering the four building shapes and the best
building shape is identified by comparing the total material handling costs.
Keywords:Cross-docking, material handling, mathematical modelling, layout plan
2. The Effects Of Crossdock Shapes On Material Handling Costs
www.ijceronline.com Open Access Journal Page 2
considered the truck-door assignment problem with staging operations where the products are assigned to a lane
in cross-docking center for storage. The authors developed a genetic algorithm to solve the large sized problems.
Miao et al. [16] proposed an adaptive tabu search algorithm for the similar problem where operational time
constraints are considered. Nassief et al. [17] presented a new mixed integer mathematical model for the truck-
door assignment problem which is embedded into a Lagrangean relaxation. Fatthi et al. [18] proposed a mixed
integer mathematical model for solving a real-time truck-door assignment problem by considering the
operational times in cross-docking center where the aim of the model is to minimize total service time of trucks
and reduce the waiting time of trucks before the service.
In this paper, the effects of the crossdock shapes on material handling cost from inbound doors to outbound
doors are analyzed by considering four different type building shapes. To identify the best shape of the cross-
docking centers, a mathematical model is formulated based on the truck-door assignment problem in cross-
docking centers which aims to determine best assignment plan of trucks to doors that minimizes the total
movement of the products. In this content, the rest of the paper consists of the following parts: problem
definition, model formulation, computational results and finally conclusion.
II. PROBLEM DEFINITION
In order to identify the effects of building shapes on material flow efficiency for cross-docking systems, four
type of crossdock shapes given in Figure 1 are considered in this study, where Figure 1a, 1b, 1c, and 1d
represent I, L, T, and U shape for the buildings, respectively. To evaluate the performance of the building shapes
on the basis of material flow from inbound doors to outbound doors, the truck-door assignment problem is taken
into account to determine material handling cost in cross-docking centers.
a. I shape for the crossdock layout b. L shape for the crossdock layout
c. T shape for the crossdock layout d.U shape for the crossdock layout
Figure 1. Considered layout shapes for the crossdocks
In truck-door assignment problem in cross-docking center, the products picked up from suppliers are unloaded
from incoming trucks at inbound doors and moved to the temporary storage area after consolidation operations.
Subsequently, products are transferred from temporary storage area to outbound doors according to their
destinations and loaded into the outgoing trucks for distribution. The objective of the problem is to find best
assignment plans in cross-docking center to minimize total travelling distance of the products. In this study, the
truck-door assignments plans are taken into account with the following assumptions:
Each truck can be used for only one location and also each location can be serviced by one
incoming/outgoing truck, which means that each supplier/customer location is assigned to a door in cross-
docking center.
3. The Effects Of Crossdock Shapes On Material Handling Costs
www.ijceronline.com Open Access Journal Page 3
Each door can be used by incoming or outgoing trucks.
For each door at most one truck can be assigned in a planning horizon.
Material flow in cross-docking center is considered from incoming truck to outgoing truck. The movements
from incoming trucks to temporary storage area and from temporary storage area to outgoing trucks are
ignored.
III. MODEL FORMULATION
According to the assumptions described above, the truck-door assignment problem of cross-docking center is
formulated as a linear mathematical model as follows:
Parameters
Number of incoming trucks
Number of outgoing trucks
Number of doors
Number of products transported from suppliers to customers
Incoming truck label of product ;
Outgoing truck label of product ;
Transportation cost of a product between door and door ;
Decision Variables
is a binary variable and equal to if incoming truck is assigned to door and otherwise;
is a binary variable and equal to if outgoing truck is assigned to door and otherwise;
is a binary variable and equal to if product is moved from door to door and otherwise;
Using the parameters and decision variables described mentioned above, the truck-door assignment problem of
cross-docking center is formulated as follows.
Subject to:
The objective function (1) aims to minimize total transportation cost of the products in cross-docking center.
Constraints (2) and (3) assign each incoming and outgoing truck to a door, respectively. Constraint (4) ensures
that the maximum one vehicle can be assigned to a door. Constraints (5) – (7) identify the movement of the
4. The Effects Of Crossdock Shapes On Material Handling Costs
www.ijceronline.com Open Access Journal Page 4
products between the doors, where constraint (5) assigns each product to doors and constraints (6) and (7)
guarantee that a product can be assigned to a door if it unloaded or loaded at there. Constraints (8) – (10) define
the binary decision variables of the model.
IV. COMPUTATIONAL RESULTS
In order to analyze the effects of the layout shapes on material handling costs in cross-docking centers, 15
different sized instance are randomly generated and solved by using the proposed mathematical model. For each
instance four layout shapes (I, L, T, U) with equal area and number of doors are respectively considered. Table 1
presents the details of the generated problems and their solutions which are obtained by using the Gurobi 6.0.4
solver with one hour time limitation. The solutions of the instances are identified in Table 1 with their objective
function value (OFV) and optimality gap (%Gap) value.
It can be concluded from the computational results that the minimum average cost for the product movements is
obtained with the I shape crossdock layout. Although the average number of products for the instances is 61.9,
the I shape layout provides a saving according to the other layout shapes, such as 3.90% for L shape, 1.54% for
T shape and 1.70% for U shape. Moreover, the results of the instances 1-3, 5-6, 9, whose solutions are optimum
for each crossdock shape, indicate that the average savings between the I shape and other shapes shown in Table
2 are 7.18%, 4.95%, and 6.66%. As a result, it should be pointed out that the I shape building for the cross-
docking centers provide effective movements according to L, T, and U shape buildings.
Table 1. Problems descriptions and Gurobi solutions
Problem
No
Number of
Products
I Shape L Shape T Shape U Shape
OFV %Gap OFV %Gap OFV %Gap OFV %Gap
1 59 336 0.0 349 0.0 350 0.0 350 0.0
2 73 494 0.0 535 0.0 538 0.0 538 0.0
3 58 386 0.0 433 0.0 400 0.0 434 0.0
4 52 390 0.0 422 0.0 396 0.0 420 10.0
5 49 336 0.0 366 0.0 352 0.0 356 0.0
6 85 636 0.0 699 0.0 666 0.0 684 0.0
7 31 220 0.0 228 0.0 220 10.3 232 7.2
8 70 606 4.3 636 7.7 622 7.6 610 4.8
9 70 633 0.0 657 0.0 666 0.0 660 0.0
10 64 652 17.4 672 15.0 694 11.1 652 11.5
11 59 574 13.7 591 13.4 580 14.9 554 16.5
12 73 940 13.0 895 19.9 858 14.2 882 19.6
13 60 558 25.4 597 26.7 582 27.0 570 18.3
14 62 662 22.3 680 20.5 670 23.3 666 28.0
15 64 704 29.4 689 24.6 660 22.4 660 22.1
Average 61.9 541.8 8.37 563.8 8.52 550.3 8.72 551.2 9.20
Table 2. Cost savings between the I shape and other shapes (L, T, and U)
Problem
No
Saving%
I - L Shape I - T Shape I - U Shape
1 3.72 4.00 4.00
2 7.66 8.18 8.18
3 10.85 3.50 11.06
5 8.20 4.55 5.62
6 9.01 4.50 7.02
9 3.65 4.95 4.09
Average 7.18 4.95 6.66
V. CONCLUSION
In this study, the effects of the crossdock shapes on material handling cost are analyzed by considering four type
of building shapes: I, L, T, and U for cross-docking centers. To identify the best shape of the cross-docking
centers, a mathematical model is formulated based on the truck-door assignment problem in cross-docking
centers. The performance of the building shapes are tested on a problem set by using the Gurobi 6.0.4 solver.
The results show that the I shape for the crossdock buildings provides effective material handling plans from
inbound doors to outbound doors with respect to other three building shapes.
REFERENCES
[1]. A.-L. Ladier and G.Alpan.Cross-Docking Operations: Current Research versus Industry Practice. Omega, 62:145-162, 2016.
5. The Effects Of Crossdock Shapes On Material Handling Costs
www.ijceronline.com Open Access Journal Page 5
[2]. M. Yazdani, B. Naderi and M. Mousakhani. A Model and Metaheuristic for Truck Scheduling in Multi-Door Cross-Dock Problems.
Intelligent Automation & Soft Computing, 21(4):633-644, 2015.
[3]. F.H. Staudt, G. Alpan, M. Di Mascolo and C.M.T. Rodriguez. Warehouse Performance Measurement: A Literature Review.
International Journal of Production Research, 53(18):5524-5544, 2015.
[4]. J. Van Belle, P. Valckenaers and D. Cattrysse.Cross-docking: State of the art. Omega, 40(6):827-846, 2012.
[5]. N. Boysen and M. Fliedner. Cross Dock Scheduling: Classification, Literature Review and Research Agenda. Omega, 38(6): 413-
422, 2010.
[6]. L.Y. Tsui and C.-H. Chang. A Microcomputer Based Decision Support Tool for Assigning Dock Doors in Freight Yards.
Computers & Industrial Engineering, 19(1):309-312, 1990.
[7]. L.Y. Tsui and C.-H. Chang. An Optimal Solution to a Dock Door Assignment Problem. Computers & Industrial Engineering,
23(1):283-286, 1992.
[8]. T. Bartz-Beielstein, A. Chmielewski, M. Janas,B. Naujoks and R. Scheffermann. Optimizing Door Assignment in LTL-Terminals
by Evolutionary Multiobjective Algorithms. IEEE Congress on Evolutionary Computation, Vancouver, Canada, 16-21 July: 41-47,
2006.
[9]. Y. Cohen and B. Keren. Trailer to Door Assignment in a Synchronous Cross-Dock Operation. International Journal of Logistics
Systems and Management, 5(5):574-590, 2009.
[10]. Y. Oh, H. Hwang, C.N. Cha and S.Lee.ADock-Door Assignment Problem for the Korean Mail Distribution Center. Computers &
Industrial Engineering, 51(2):288-296, 2006.
[11]. Y.A. Bozer and H.J. Carlo. Optimizing Inbound and Outbound Door Assignments in Less-Than-Truckload Crossdocks. IIE
Transactions, 40(11):1007-1018, 2008.
[12]. V.F. Yu, D. Sharma andK.G.Murty.DoorAllocations to Origins and Destinations at Less-Than-Truckload Trucking Terminals.
Journal of Industrial and Systems Engineering, 2(1):1-15, 2008.
[13]. Z. Miao, A. Lim and H. Ma. Truck Dock Assignment Problem with Operational Time Constraint within Crossdocks. European
Journal of Operational Research, 192(1):105-115, 2009.
[14]. K. Stephan and N. Boysen. Vis-À-Vis vs. Mixed Dock Door Assignment: A Comparison of Different Cross Dock Layouts.
Operations Management Research, 4(3-4): 150-163, 2011.
[15]. G. Luo and J.S. Noble. An Integrated Model for Crossdock Operations Including Staging. International Journal of Production
Research, 50(9):2451-2464, 2012.
[16]. Z. Miao, S. Cai and D.Xu.Applyingan Adaptive Tabu Search Algorithm to Optimize Truck-Dock Assignment in the Crossdock
Management System. Expert Systems with Applications, 41(1):16-22, 2014.
[17]. W. Nassief, I. Contreras, and R. As’ad. A Mixed-Integer Programming Formulation and Lagrangean Relaxation for the Cross-Dock
Door Assignment Problem. International Journal of Production Research, 54(2):494-508, 2016.
[18]. W.N.A.W.A. Fatthi, A. Shuib and R.M. Dom. A Mixed Integer Programming Model for Solving Real-Time Truck-To-Door
Assignment and Scheduling Problem at Cross Docking Warehouse. Journal of Industrial and Management Optimization, 12(2):
431-447, 2016.