Engineering Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Description

This cluster of papers focuses on the design and control of warehouse operations, including topics such as order picking, facility layout, automated guided vehicles, cellular manufacturing systems, dynamic facility layout, material handling systems, storage assignment, robotic fulfillment systems, and e-commerce warehousing.

Keywords

Warehouse Design; Order Picking; Facility Layout; Automated Guided Vehicles; Cellular Manufacturing Systems; Dynamic Facility Layout; Material Handling Systems; Storage Assignment; Robotic Fulfillment Systems; E-commerce Warehousing

This book provides the most advanced, comprehensive, and balanced coverage on the market of the technical and engineering aspects of automated production systems. It covers all the major cutting-edge technologies … This book provides the most advanced, comprehensive, and balanced coverage on the market of the technical and engineering aspects of automated production systems. It covers all the major cutting-edge technologies of production automation and material handling, and how these technologies are used to construct modern manufacturing systems. Manufacturing Operations; Industrial Control Systems; Sensors, Actuators, and Other Control System Components; Numerical Control; Industrial Robotics; Discrete Control Using Programmable Logic Controllers and Personal Computers; Material Transport Systems; Storage Systems; Automatic Data Capture; Single Station Manufacturing Cells; Group Technology and Cellular Manufacturing; Flexible Manufacturing Systems; Manual Assembly Lines; Transfer Lines and Similar Automated Manufacturing Systems; Automated Assembly Systems; Statistical Process Control; Inspection Principles and Practices; Inspection Technologies; Product Design and CAD/CAM in the Production System; Process Planning and Concurrent Engineering; Production Planning and Control Systems; and Lean Production and Agile Manufacturing. For anyone interested in Automation, Production Systems, and Computer-Integrated Manufacturing.
The optimal assignment of facilities to locations is a combinatorial problem that remains unsolved. None of the several optimal-producing procedures is computationally feasible for any but small problems. Three previously … The optimal assignment of facilities to locations is a combinatorial problem that remains unsolved. None of the several optimal-producing procedures is computationally feasible for any but small problems. Three previously proposed heuristic techniques (craft, one by Hillier, one by Hillier and Connors) and one new one (Biased Sampling) are examined and experimentally compared for problems of from five departments to 30 departments. The new Biased Sampling procedure is seen to produce the best solutions but at relatively high computational cost. The Hillier-Connors procedure is especially interesting because it is considerably faster than craft and Biased Sampling and its solutions are only 2–6 per cent worse than Biased Sampling and only slightly worse than craft.
This paper presents a comprehensive model framework for linking decisions and performance throughout the material-production-distribution supply chain. The purpose of the model is to support analysis of alternative manufacturing material/service … This paper presents a comprehensive model framework for linking decisions and performance throughout the material-production-distribution supply chain. The purpose of the model is to support analysis of alternative manufacturing material/service strategies. A series of linked, approximate submodels and an heuristic optimization procedure are introduced. A prototype software implementation is also discussed.
This paper presents a new methodology for determining suboptimum relative location patterns for physical facilities. It presents a computer program governed by an algorithm which determines how relative location patterns … This paper presents a new methodology for determining suboptimum relative location patterns for physical facilities. It presents a computer program governed by an algorithm which determines how relative location patterns should be altered to obtain sequentially the most improved pattern with each change, commands their alteration, evaluates the results of alterations, and identifies the sub-optimum relative location patterns. 3 The computer output yields a block diagramatic layout of the facility areas, and the areas need not be equal. 4 A manufacturing plant layout example is used because the methodology is well illustrated by reference to some kind of example, and this one is commonly known. The methodology itself, however, is general in nature and not restricted to such applications.
Abstract RFID technologies hold the promise of closing some of the information gaps in the supply chain, especially in retailing and logistics. As a mobile technology, RFID can enable “process … Abstract RFID technologies hold the promise of closing some of the information gaps in the supply chain, especially in retailing and logistics. As a mobile technology, RFID can enable “process freedoms” and real-time visibility into supply chains. This article provides an introduction to the technology, several case examples, and implementation guidelines for managers based on published reports.
This paper reports the findings of a survey study of 32 U.S. firms involved with cellular manufacturing. Areas covered include the reasons for establishing cells, benefits achieved, types and sizes … This paper reports the findings of a survey study of 32 U.S. firms involved with cellular manufacturing. Areas covered include the reasons for establishing cells, benefits achieved, types and sizes of cells, extent of cellularization in the plants, methods used to design the cells, changes to planning and control systems, labour-related issues and important experiences gained by the companies. The data presented here were collected as part of a larger study of various group technology (GT) applications in which 53 companies participated. GT applications other than cellular manufacturing are described in Hyer and Wemmerlöv, 1989, Group technology in the U.S. manufacturing industry: a survey of current practices, International Journal of Production Research.
Given a planar graph G together with a planar representation P, a region preserving grid embedding of G is a planar embedding of G in the rectilinear grid that has … Given a planar graph G together with a planar representation P, a region preserving grid embedding of G is a planar embedding of G in the rectilinear grid that has planar representation isomorphic to P. In this paper, an algorithm is presented that computes a region preserving grid embedding with the minimum number of bends in edges. This algorithm makes use of network flow techniques, and runs in time $O(n^2 \log n)$, where n is the number of vertices of the graph. Constrained versions of the problem are also considered, and most results are extended to k-gonal graphs, i.e., graphs whose edges are sequences of segments with slope multiple of ${{180} / k}$ degrees. Applications of the above results can be found in several areas: VLSI circuit layout, architectural design, communication by light or microwave, transportation problems, and automatic layout of graphlike diagrams.
This paper addresses the problem of order-picking in a rectangular warehouse that contains crossovers only at the ends of aisles. An algorithm is presented for picking an order in minimum … This paper addresses the problem of order-picking in a rectangular warehouse that contains crossovers only at the ends of aisles. An algorithm is presented for picking an order in minimum time. The computational effort required is linear in the number of aisles. The procedure has been implemented on a microcomputer A 50-aisle problem requires only about 1 minute to solve.
Previous article Next article Heuristic Methods for Location-Allocation ProblemsLeon CooperLeon Cooperhttps://doi.org/10.1137/1006005PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Leon Cooper, Location-allocation problems, Operations Res., 11 (1963), 331–343, No. 3 MR0152365 0113.14201 … Previous article Next article Heuristic Methods for Location-Allocation ProblemsLeon CooperLeon Cooperhttps://doi.org/10.1137/1006005PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Leon Cooper, Location-allocation problems, Operations Res., 11 (1963), 331–343, No. 3 MR0152365 0113.14201 CrossrefISIGoogle Scholar[2] Google Scholar[3] D. H. Lehmer, Teaching combinatorial tricks to a computerProc. Sympos. Appl. Math., Vol. 10, American Mathematical Society, Providence, R.I., 1960, 179–193, Combinatorial Analysis MR0113289 0096.00504 CrossrefGoogle Scholar[4] J. Heller, Some numerical experiments for an $M\times J$ flow shop and its decision-theoretical aspects, Operations Res., 8 (1960), 178–184, No. 2 MR0111626 0092.27910 CrossrefISIGoogle Scholar[5] J. Moshman, The Application of Sequential Estimation To Computer Simulation and Monte Carlo Procedures, J. Association for Computing Machinery, 5 (1958), 0086.11603 CrossrefISIGoogle Scholar[6] A. Wald, Sequential Analysis, John Wiley and Sons, New York, 1952 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails An elliptical cover problem in drone delivery network design and its solution algorithmsEuropean Journal of Operational Research, Vol. 304, No. 3 | 1 Feb 2023 Cross Ref Two lower-bounding algorithms for the p-center problem in an areaComputational Urban Science, Vol. 2, No. 1 | 24 January 2022 Cross Ref Optimal planar facility location with dense demands along a curveJournal of the Operational Research Society, Vol. 73, No. 8 | 8 May 2021 Cross Ref A continuous location and maintenance routing problem for offshore wind farms: Mathematical models and hybrid methodsComputers & Operations Research, Vol. 144 | 1 Aug 2022 Cross Ref Spatial autocorrelation informed approaches to solving location–allocation problemsSpatial Statistics, Vol. 50 | 1 Aug 2022 Cross Ref Electric vehicle charging stations emplacement using genetic algorithms and agent-based simulationExpert Systems with Applications, Vol. 197 | 1 Jul 2022 Cross Ref Less is more: simple algorithms for the minimum sum of squares clustering problemIMA Journal of Management Mathematics, Vol. 33, No. 3 | 19 August 2021 Cross Ref Less is more: discrete starting solutions in the planar p-median problemTOP, Vol. 30, No. 1 | 6 April 2021 Cross Ref A two-level off-grid electric distribution problem on the continuous spaceComputers & Operations Research, Vol. 67 | 1 Apr 2022 Cross Ref Continuous Facility Location ProblemsThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref The New Era of Hybridisation and Learning in Heuristic Search DesignThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Less Is More Approach in Heuristic OptimizationThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Formulation Space Search MetaheuristicThe Palgrave Handbook of Operations Research | 8 July 2022 Cross Ref Surface ozone monitoring and policy: A geospatial decision support tool for suitable location of monitoring stations in urban areasEnvironmental Science & Policy, Vol. 126 | 1 Dec 2021 Cross Ref Articulating Spatial Statistics and Spatial Optimization Relationships: Expanding the Relevance of StatisticsStats, Vol. 4, No. 4 | 19 October 2021 Cross Ref Discrete Facility Location in Machine LearningJournal of Applied and Industrial Mathematics, Vol. 15, No. 4 | 10 July 2022 Cross Ref Teaching Spreadsheet‐Based Analysis of Multisource Continuous Facility Location ProblemsDecision Sciences Journal of Innovative Education | 9 August 2021 Cross Ref A matheuristic for the stochastic facility location problemJournal of Heuristics, Vol. 27, No. 4 | 26 February 2021 Cross Ref Edge computing server placement with capacitated location allocationJournal of Parallel and Distributed Computing, Vol. 153 | 1 Jul 2021 Cross Ref Evaluation of heuristics for the p-median problem: Scale and spatial demand distributionComputers, Environment and Urban Systems, Vol. 88 | 1 Jul 2021 Cross Ref Self-Configuring (1 + 1)-Evolutionary Algorithm for the Continuous p-Median Problem with Agglomerative MutationAlgorithms, Vol. 14, No. 5 | 22 April 2021 Cross Ref Complex Energy Networks Optimization: Part I—Development and Validation of a Software for Optimal Load AllocationJournal of Engineering for Gas Turbines and Power, Vol. 143, No. 4 | 22 February 2021 Cross Ref Fiber to the Home (FTTH) Automation Planning, Its Impact on Customer Satisfaction & Cost-EffectivenessWireless Personal Communications, Vol. 117, No. 2 | 24 November 2020 Cross Ref Heuristic-Based Location Allocation of Single Frequency Network StationsIEEE Transactions on Broadcasting, Vol. 67, No. 1 | 1 Mar 2021 Cross Ref Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approachAnnals of Operations Research, Vol. 41 | 5 February 2021 Cross Ref Optimized Supply Chain Management of Rice in South Korea: Location–Allocation Model of Rice ProductionAgronomy, Vol. 11, No. 2 | 31 January 2021 Cross Ref When closest is not always the best: The distributed p-median problemJournal of the Operational Research Society, Vol. 72, No. 1 | 12 December 2019 Cross Ref Particle Swarm Optimization and Grey Wolf Optimizer to Solve Continuous p-Median Location ProblemsMachine Learning and Big Data Analytics Paradigms: Analysis, Applications and Challenges | 15 December 2020 Cross Ref Location and capacity decisions for electric bus charging stations considering waiting timesTransportation Research Part D: Transport and Environment, Vol. 90 | 1 Jan 2021 Cross Ref APPROPRIATE ALLOCATIONS AND LOCATIONS ANALYSIS OF INCINERATION FACILITIES BY MULTI-OBJECTIVE OPTIMIZATION USING VORONOI DIAGRAM AND GENETIC ALGORITHM: A CASE STUDY OF THE NORTHWESTERN BAY AREA IN CHIBA PREFECTURETransactions of the Operations Research Society of Japan, Vol. 64, No. 0 | 1 Jan 2021 Cross Ref Directional approach to gradual cover: the continuous caseComputational Management Science, Vol. 18, No. 1 | 18 October 2020 Cross Ref An Approximation Approach for Fixed-Charge Transportation-p-Facility Location ProblemLogistics and Supply Chain Management | 30 October 2021 Cross Ref Self-Adjusting Variable Neighborhood Search Algorithm for Near-Optimal k-Means ClusteringComputation, Vol. 8, No. 4 | 5 November 2020 Cross Ref K-Means Genetic Algorithms with Greedy Genetic OperatorsMathematical Problems in Engineering, Vol. 2020 | 27 Nov 2020 Cross Ref On the convergence of the Cooper’s algorithmOptimization Letters, Vol. 14, No. 8 | 23 March 2020 Cross Ref The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methodsJournal of Global Optimization, Vol. 78, No. 2 | 6 December 2019 Cross Ref An exact and a heuristic approach for the transportation-p-facility location problemComputational Management Science, Vol. 17, No. 3 | 30 January 2020 Cross Ref Heuristic approaches for solid transportation-p-facility location problemCentral European Journal of Operations Research, Vol. 28, No. 3 | 28 January 2019 Cross Ref A voltage drop limited decentralized electric power distribution networkComputers & Operations Research, Vol. 118 | 1 Jun 2020 Cross Ref ReferencesLocation‐based Marketing | 17 April 2020 Cross Ref An ADMM-based location–allocation algorithm for nonconvex constrained multi-source Weber problem under gaugeJournal of Global Optimization, Vol. 76, No. 4 | 11 June 2019 Cross Ref The blockwise coordinate descent method for integer programsMathematical Methods of Operations Research, Vol. 91, No. 2 | 15 June 2019 Cross Ref Biologically Inspired Parent Selection in Genetic AlgorithmsAnnals of Operations Research, Vol. 287, No. 1 | 22 July 2019 Cross Ref Accelerated hyperbolic smoothing method for solving the multisource Fermat–Weber and k-Median problemsKnowledge-Based Systems, Vol. 191 | 1 Mar 2020 Cross Ref Scaling up an Edge Server Deployment2020 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops) | 1 Mar 2020 Cross Ref Classical and Inverse Median Location Problems under Uncertain EnvironmentActa Mathematicae Applicatae Sinica, English Series, Vol. 36, No. 2 | 11 April 2020 Cross Ref 2020 Cross Ref Multi-facility green Weber problemComputers & Operations Research, Vol. 113 | 1 Jan 2020 Cross Ref A Spatial Optimization Approach for Solving a Multi-facility Location Problem with Continuously Distributed DemandInnovations in Urban and Regional Systems | 12 May 2020 Cross Ref Optimizing Field Productivity by Mobile Warehouse Deployment Using Evolutionary Algorithms2019 IEEE Symposium Series on Computational Intelligence (SSCI) | 1 Dec 2019 Cross Ref Hub relay network design for daily driver routesInternational Journal of Production Research, Vol. 57, No. 19 | 12 February 2019 Cross Ref Revised Weighted Fuzzy C-Means and Fortified Weiszfeld Hybrid Method for Uncapacitated Multi-Facility Location ProblemsInternational Journal of Operations Research and Information Systems, Vol. 10, No. 4 | 1 Oct 2019 Cross Ref Solving multiple facilities location problems with separated clustersOperations Research Letters, Vol. 47, No. 5 | 1 Sep 2019 Cross Ref A Benders Decomposition Method for Designing Reliable Supply Chain Networks Accounting for Multimitigation Strategies and Demand LossesTransportation Science, Vol. 53, No. 5 | 1 Sep 2019 Cross Ref Spatial optimization for land acquisition problems: A review of models, solution methods, and GIS supportTransactions in GIS, Vol. 16 | 6 June 2019 Cross Ref Uncertain multi-objective multi-commodity multi-period multi-vehicle location-allocation model for earthquake evacuation planningApplied Mathematics and Computation, Vol. 350 | 1 Jun 2019 Cross Ref The location-allocation problem of drone base stationsComputers & Operations Research | 1 Jun 2019 Cross Ref Optimizing the spatial relocation of hospitals to reduce urban traffic congestion: A case study of BeijingTransactions in GIS, Vol. 23, No. 2 | 1 April 2019 Cross Ref The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problemAnnals of Operations Research, Vol. 275, No. 2 | 23 August 2018 Cross Ref A directional approach to gradual coverTOP, Vol. 27, No. 1 | 15 November 2018 Cross Ref The Optimal Solution Set of the Multi-source Weber ProblemBulletin of the Iranian Mathematical Society, Vol. 45, No. 2 | 12 July 2018 Cross Ref Give-And-Take heuristic model to political redistricting problemsSpatial Information Research, Vol. 5 | 2 March 2019 Cross Ref Crowdsourcing planar facility location allocation problemsComputing, Vol. 101, No. 3 | 20 October 2018 Cross Ref The planar multifacility collection depots location problemComputers & Operations Research, Vol. 102 | 1 Feb 2019 Cross Ref Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste managementAnnals of Operations Research, Vol. 273, No. 1-2 | 4 June 2018 Cross Ref Optimization of competitive facility location for chain storesAnnals of Operations Research, Vol. 273, No. 1-2 | 15 July 2017 Cross Ref Optimal solutions for the continuous p -centre problem and related -neighbour and conditional problems: A relaxation-based algorithmJournal of the Operational Research Society, Vol. 70, No. 2 | 19 January 2018 Cross Ref Introduction: The Practice of Spatial AnalysisThe Practice of Spatial Analysis | 29 June 2018 Cross Ref 2019 Cross Ref 2019 Cross Ref 2019 Cross Ref 2019 Cross Ref Understanding the Weber Location ParadigmContributions to Location Analysis | 8 October 2019 Cross Ref Locating Dimensional Facilities in a Continuous SpaceLocation Science | 17 March 2020 Cross Ref An algorithm for generalized constrained multi-source Weber problem with demand substations4OR, Vol. 16, No. 4 | 2 December 2017 Cross Ref The Weber obnoxious facility location model: A Big Arc Small Arc approachComputers & Operations Research, Vol. 98 | 1 Oct 2018 Cross Ref MIP model for efficient dimensioning of real-world FTTH treesTelecommunication Systems, Vol. 68, No. 2 | 27 September 2017 Cross Ref Classifiers Applied to Dimensioning of Splitters in PON DesignJournal of Optical Communications and Networking, Vol. 10, No. 6 | 21 May 2018 Cross Ref Optimal number and location of storage hubs and biogas production reactors in farmlands with allocation of multiple feedstocksApplied Mathematical Modelling, Vol. 55 | 1 Mar 2018 Cross Ref Considering Diversity in Spatial Decision Support SystemsGeoComputational Analysis and Modeling of Regional Systems | 31 July 2017 Cross Ref Spatial Autocorrelation and the p-Median ProblemMorphisms for Quantitative Spatial Analysis | 8 March 2018 Cross Ref Location Modeling and Covering MetricsLocation Covering Models | 23 December 2018 Cross Ref Vers un merchandising multi-agentsRetailing et localisation | 1 Jan 2018 Cross Ref A distance-limited continuous location-allocation problem for spatial planning of decentralized systemsComputers & Operations Research, Vol. 88 | 1 Dec 2017 Cross Ref A Two-echelon joint continuous-discrete location modelEuropean Journal of Operational Research, Vol. 262, No. 3 | 1 Nov 2017 Cross Ref Incorporating neighborhood reduction for the solution of the planar p-median problemAnnals of Operations Research, Vol. 258, No. 2 | 12 August 2015 Cross Ref The continuous single source location problem with capacity and zone-dependent fixed cost: Models and solution approachesEuropean Journal of Operational Research, Vol. 263, No. 1 | 1 Nov 2017 Cross Ref The capacitated multi-facility weber problem with polyhedral barriers: Efficient heuristic methodsComputers & Industrial Engineering, Vol. 113 | 1 Nov 2017 Cross Ref Transportation-location problem with unknown number of facilitiesComputers & Industrial Engineering, Vol. 112 | 1 Oct 2017 Cross Ref Non-myopic relocation of idle mobility-on-demand vehicles as a dynamic location-allocation-queueing problemTransportation Research Part E: Logistics and Transportation Review, Vol. 106 | 1 Oct 2017 Cross Ref A versatile adaptive aggregation framework for spatially large discrete location-allocation problemsComputers & Industrial Engineering, Vol. 111 | 1 Sep 2017 Cross Ref On Strategies to Fix Degenerate k-means SolutionsJournal of Classification, Vol. 34, No. 2 | 10 June 2017 Cross Ref Speeding up the optimal method of Drezner for the p -centre problem in the planeEuropean Journal of Operational Research, Vol. 257, No. 3 | 1 Mar 2017 Cross Ref 2-Facility manifold location routing problemOptimization Letters, Vol. 11, No. 2 | 26 December 2015 Cross Ref Location Planning and Network DesignComputational Intelligence in Logistics and Supply Chain Management | 28 July 2016 Cross Ref Hybridisation SearchHeuristic Search | 21 February 2017 Cross Ref Bringing infrastructure into pricing in road freight transportation – A measuring concept based on navigation service dataTransportation Research Procedia, Vol. 25 | 1 Jan 2017 Cross Ref A Genetic Algorithm to Solve the Optimum Location Problem for Surveillance SensorsJournal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography, Vol. 34, No. 6 | 31 Dec 2016 Cross Ref Mixed planar and network single-facility location problemsNetworks, Vol. 68, No. 4 | 18 August 2016 Cross Ref Sequential location of two facilities: comparing random to optimal location of the first facilityAnnals of Operations Research, Vol. 246, No. 1-2 | 19 August 2014 Cross Ref New local searches for solving the multi-source Weber problemAnnals of Operations Research, Vol. 246, No. 1-2 | 5 February 2015 Cross Ref An adaptive perturbation-based heuristic: An application to the continuous p-centre problemComputers & Operations Research, Vol. 75 | 1 Nov 2016 Cross Ref Insights into the effect of traffic congestion on distribution network characteristics – a numerical analysis based on navigation service dataInternational Journal of Logistics Research and Applications, Vol. 19, No. 5 | 13 November 2015 Cross Ref Modeling and solving a capacitated stochastic location-allocation problem using sub-sourcesSoft Computing, Vol. 20, No. 6 | 17 March 2015 Cross Ref A minisum location problem with regional demand considering farthest Euclidean distancesOptimization Methods and Software, Vol. 31, No. 3 | 23 December 2015 Cross Ref Hybrid self-adaptive-velocity particle swarm optimisation-Cooper heuristic for the facility location allocation problem in JakartaInternational Journal of Systems Science: Operations & Logistics, Vol. 3, No. 2 | 14 April 2015 Cross Ref Planning the City Logistics Terminal Location by Applying the Green p -Median Model and Type-2 Neurofuzzy NetworkComputational Intelligence and Neuroscience, Vol. 2016 | 1 Jan 2016 Cross Ref Manifold Location Routing Problem with Applications in Network TheoryModels, Algorithms and Technologies for Network Analysis | 21 October 2016 Cross Ref Prepositioning of Relief Items Under Uncertainty: A Classification of Modeling and Solution Approaches for Disaster ManagementLogistics Management | 9 August 2015 Cross Ref StandortmanagementStrategisches und operatives Logistikmanagement: Distribution | 15 October 2015 Cross Ref A location–allocation problem with concentric circlesIIE Transactions, Vol. 47, No. 12 | 28 April 2015 Cross Ref Solving the planar p-median problem by variable neighborhood and concentric searchesJournal of Global Optimization, Vol. 63, No. 3 | 23 April 2014 Cross Ref A Parallel Algorithm for the Facility Location Problem Applied to Oil and Gas Logistics2015 International Symposium on Computer Architecture and High Performance Computing Workshop (SBAC-PADW) | 1 Oct 2015 Cross Ref A capacitated location-allocation problem with stochastic demands using sub-sources: An empirical studyApplied Soft Computing, Vol. 34 | 1 Sep 2015 Cross Ref A Heuristic for the Multisource Weber Problem with Service Level ConstraintsTransportation Science, Vol. 49, No. 3 | 1 Aug 2015 Cross Ref A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfacesComputational Management Science, Vol. 12, No. 3 | 23 December 2014 Cross Ref A Constructive Method and a Guided Hybrid GRASP for the Capacitated Multi-Source Weber Problem in the Presence of Fixed CostJournal of Algorithms & Computational Technology, Vol. 9, No. 2 | 1 June 2015 Cross Ref Approximation methods for large-scale spatial queueing systemsTransportation Research Part B: Methodological, Vol. 74 | 1 Apr 2015 Cross Ref The continuous p-centre problem: An investigation into variable neighbourhood search with memoryEuropean Journal of Operational Research, Vol. 241, No. 3 | 1 Mar 2015 Cross Ref Applied Soft Computing | 2015 Cross Ref Investigating Metaheuristics Applications for Capacitated Location Allocation Problem on Logistics NetworksChaos Modeling and Control Systems Design | 4 December 2014 Cross Ref Heuristics for a continuous multi-facility location problem with demand regionsComputers & Operations Research | 1 Sep 2014 Cross Ref Serving regional demand in facility locationPapers in Regional Science, Vol. 93, No. 3 | 4 April 2013 Cross Ref A historical perspective on location problemsBSHM Bulletin: Journal of the British Society for the History of Mathematics, Vol. 29, No. 2 | 9 May 2014 Cross Ref New heuristic algorithms for solving the planar p-median problemComputers & Operations Research | 1 May 2014 Cross Ref Modeling Influenza Pandemic and Planning Food DistributionManufacturing & Service Operations Management, Vol. 16, No. 1 | 1 Feb 2014 Cross Ref A new local search for continuous location problemsEuropean Journal of Operational Research, Vol. 232, No. 2 | 1 Jan 2014 Cross Ref Location equilibria for a continuous competitive facility location problem under delivered pricingComputers & Operations Research, Vol. 41 | 1 Jan 2014 Cross Ref The planar hub location problem: a probabilistic clustering approachAnnals of Operations Research, Vol. 211, No. 1 | 1 June 2013 Cross Ref Location of a distribution center for a perishable productMathematical Methods of Operations Research, Vol. 78, No. 3 | 13 July 2013 Cross Ref Beam search heuristics for the single and multi-commodity capacitated Multi-facility Weber ProblemsComputers & Operations Research, Vol. 40, No. 12 | 1 Dec 2013 Cross Ref New heuristic methods for the single-source capacitated multi facility Weber problemThe International Journal of Advanced Manufacturing Technology, Vol. 69, No. 5-8 | 28 June 2013 Cross Ref Continuous covering and cooperative covering problems with a general decay function on networksJournal of the Operational Research Society, Vol. 64, No. 11 | 21 December 2017 Cross Ref A hybrid metaheuristic approach for the capacitated p-median problemApplied Soft Computing, Vol. 13, No. 9 | 1 Sep 2013 Cross Ref An efficient heuristic algorithm for the capacitated $$p-\!$$ median problem4OR, Vol. 11, No. 3 | 16 December 2012 Cross Ref Continuous location of an assembly stationTOP, Vol. 21, No. 2 | 13 April 2011 Cross Ref Heuristics for the single source capacitated multi-facility Weber problemComputers & Industrial Engineering, Vol. 64, No. 4 | 1 Apr 2013 Cross Ref Models and Algorithms for Hub and Spoke Locations for Emergency Service Facilities in Response to Serious Emergency IncidentsHuman and Ecological Risk Assessment: An International Journal, Vol. 19, No. 2 | 4 Mar 2013 Cross Ref Simultaneous berth allocation and yard planning at tactical levelOR Spectrum, Vol. 35, No. 2 | 9 September 2012 Cross Ref A new heuristic for solving the p-median problem in the planeComputers & Operations Research, Vol. 40, No. 1 | 1 Jan 2013 Cross Ref Approximate solution methods for the capacitated multi-facility Weber problemIIE Transactions, Vol. 45, No. 1 | 1 Jan 2013 Cross Ref A Heuristic Algorithm for Constrained Multi-Source Location Problem with Closest Distance under Gauge: The Variational Inequality ApproachAbstract and Applied Analysis, Vol. 2013 | 1 Jan 2013 Cross Ref Research on Multi-Facility Weber Problem to Reduce Carbon EmissionsLTLGB 2012 | 3 May 2013 Cross Ref Investigating of Hybrid Meta-Heuristics to Solve the Large-Scale Multi-Source Weber Problems and Performance Measuring of them with Statistical TestsMeta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance | 1 Jan 2013 Cross Ref Generating good starting solutions for the p-median problem in the planeElectronic Notes in Discrete Mathematics, Vol. 39 | 1 Dec 2012 Cross Ref An Efficient Hybrid Particle Swarm Optimization Algorithm for Solving the Uncapacitated Continuous Location-Allocation ProblemNetworks and Spatial Economics, Vol. 12, No. 3 | 5 July 2011 Cross Ref Single-Source Capacitated Multi-Facility Weber Problem—An iterative two phase heuristic algorithmComputers & Operations Research, Vol. 39, No. 7 | 1 Jul 2012 Cross Ref Co-evolution of products and manufacturing capabilities and application in auto-parts assemblyFlexible Services and Manufacturing Journal, Vol. 24, No. 2 | 17 March 2011 Cross Ref Solving the multi-commodity capacitated multi-facility Weber problem using Lagrangean relaxation and a subgradient-like algorithmJournal of the Operational Research Society, Vol. 63, No. 6 | 21 December 2017 Cross Ref Profit Maximizing Distributed Service System Design with Congestion and Elastic DemandTransportation Science, Vol. 46, No. 2 | 1 May 2012 Cross Ref A framework of integrating GIS and parallel computing for spatial control problems – a case study of wildfire controlInternational Journal of Geographical Information Science, Vol. 26, No. 4 | 1 Apr 2012 Cross Ref A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demandComputational Optimization and Applications, Vol. 51, No. 3 | 13 January 2011 Cross Ref Facility location under demand uncertainty: Response to a large-scale bio-terror attackSocio-Economic Planning Sciences, Vol. 46, No. 1 | 1 Mar 2012 Cross Ref Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problemComputers & Operations Research, Vol. 39, No. 2 | 1 Feb 2012 Cross Ref A hierarchical algorithm for the planar single-facility location routing problemComputers & Operations Research, Vol. 39, No. 2 | 1 Feb 2012 Cross Ref Near-optimal location of two landings on flat, uniform terrainCanadian Journal of Forest Research, Vol. 42, No. 2 | 1 Feb 2012 Cross Ref Accelerating the convergence in the single-source and multi-source Weber problemsApplied Mathematics and Computation, Vol. 218, No. 12 | 1 Feb 2012 Cross Ref StandortmanagementStrategisches und operatives Logistikmanagement: Distribution | 25 September 2012 Cross Ref A Novel Two-stage Analysis Method for Customer's Requirement2011 Seventh International Conference on Computational Intelligence and Security | 1 Dec 2011 Cross Ref Solving a continuous local access network design problem with a stabilized central column generation approachEuropean Journal of Operational Research, Vol. 214, No. 3 | 1 Nov 2011 Cross Ref Variable neighbourhood search heuristics for the probabilistic multi-source Weber problemJournal of the Operational Research Society, Vol. 62, No. 10 | 21 December 2017 Cross Ref A guided reactive GRASP for the capacitated multi-source Weber problemComputers & Operations Research, Vol. 38, No. 7 | 1 Jul 2011 Cross Ref Prepositioning supplies in preparation for disastersEuropean Journal of Operational Research, Vol. 209, No. 2 | 1 Mar 2011 Cross Ref A multi-dimensional shooting algorithm for the two-facility location–allocation problem with dense demandComputers & Operations Research, Vol. 38, No. 2 | 1 Feb 2011 Cross Ref Continuous Center ProblemsFoundations of Location Analysis | 13 January 2011 Cross Ref Median Problems in NetworksFoundations of Location Analysis | 13 January 2011 Cross Ref Heuristics for Location ModelsFoundations of Location Analysis | 13 January 2011 Cross Ref An Iterative Algorithm for a Capacitated Multi-Facility Weber Problem with Fuzzy Demands2010 International Conference on E-Product E-Service and E-Entertainment | 1 Nov 2010 Cross Ref Generalized coverage: New developments in covering location modelsComputers & Operations Research, Vol. 37, No. 10 | 1 Oct 2010 Cross Ref The multi-commodity capacitated multi-facility Weber problem: heuristics and confidence intervalsIIE Transactions, Vol. 42, No. 11 | 31 Aug 2010 Cross Ref Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networksComputer Networks, Vol. 54, No. 11 | 1 Aug 2010 Cross Ref Clustering and the perturbed spatial medianMathematical and Computer Modelling, Vol. 52, No. 1-2 | 1 Jul 2010 Cross Ref Hybrid random searching algorithm for solving depot-location problem of CARPJournal of Computer Applications, Vol. 30, No. 6 | 23 Jun 2010 Cross Ref Attraction probabilities in variable neighborhood search4OR, Vol. 8, No. 2 | 16 September 2009 Cross Ref Exact and heuristic solutions of the global supply chain problem with transfer pricingEuropean Journal of Operational Research, Vol. 202, No. 3 | 1 May 2010 Cross Ref A generalized Weiszfeld method for the multi-facility location problemOperations Research Letters, Vol. 38, No. 3 | 1 May 2010 Cross Ref Tabu based heuristics for the generalized hierarchical covering location problemComputers & Industrial Engineering, Vol. 58, No. 4 | 1 May 2010 Cross Ref A continuous analysis framework for the solution of location–allocation problems with dense demandComputers & Operations Research, Vol. 37, No. 1 | 1 Jan 2010 Cross Ref A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problemComputers & Mathematics with Applications, Vol. 59, No. 1 | 1 Jan 2010 Cross Ref Locating a bioenergy facility using a hybrid optimization methodInternational Journal of Production Economics, Vol. 123, No. 1 | 1 Jan 2010 Cross Ref Cooperative cover location problems: The planar caseIIE Transactions, Vol. 42, No. 3 | 19 December 2009 Cross Ref A location–allocation heuristic for the capacitated multi-facility Weber problem with probabilistic customer locationsEuropean Journal of Operational Research, Vol. 198, No. 3 | 1 Nov 2009 Cross Ref e-Work based collaborative optimization approach for strategic logistic network design problemComputers & Industrial Engineering, Vol. 57, No. 1 | 1 Aug 2009 Cross Ref The variable radius covering problemEuropean Journal of Operational Research, Vol. 196, No. 2 | 1 Jul 2009 Cross Ref Discrete approximation heuristics for the capacitated continuous location–allocation problem with probabilistic customer locationsComputers & Operations Research, Vol. 36, No. 7 | 1 Jul 2009 Cross Ref Cost Minimization Planning for Greenfield Passive Optical NetworksJournal of Optical Communications and Networking, Vol. 1, No. 1 | 1 June 2009 Cross Ref Region-rejection based heuristics for the capacitated multi-source Weber problemComputers & Operations Research, Vol. 36, No. 6 | 1 Jun 2009 Cross Ref Spatial point process models for location–allocation problemsComputational Statistics & Data Analysis, Vol. 53, No. 8 | 1 Jun 2009 Cross Ref Solving probabilistic multi-facility Weber problem by vector quantizationOR Spectrum, Vol. 31, No. 3 | 1 January 2009 Cross Ref The multi-facility location–allocation problem with polyhedral barriersComputers & Operations Research, Vol. 36, No. 5 | 1 May 2009 Cross Ref Locational analysis: highlights of growth to maturityJournal of the Operational Research Society, Vol. 60, No. sup1 | 21 December 2017 Cross Ref Simultaneous siting and sizing of distribution centers on a planeAnnals of Operations Research, Vol. 167, No. 1 | 14 June 2008 Cross Ref Distribution Network Redesign for Marke
In this paper two classes of clustering models are considered: (1) matrix, and (2) integer programming. The relationship between the matrix model, the p-median model and the classical group technology … In this paper two classes of clustering models are considered: (1) matrix, and (2) integer programming. The relationship between the matrix model, the p-median model and the classical group technology concept is discussed. A generalized group technology concept, based on generation for one part of a number of different process plans, is proposed. This new concept improves the quality of process (part) families and machine cells. A corresponding integer programming model is formulated. The models discussed are illustrated with numerical examples.
This paper presents a formulation of the quadratic assignment problem, of which the Koopmans-Beckmann formulation is a special case. Various applications for the formulation are discussed. The equivalence of the … This paper presents a formulation of the quadratic assignment problem, of which the Koopmans-Beckmann formulation is a special case. Various applications for the formulation are discussed. The equivalence of the problem to a linear assignment problem with certain additional constraints is demonstrated. A method for calculating a lower bound on the cost function is presented, and this forms the basis for an algorithm to determine optimal solutions. Further generalizations to cubic, quartic, N-adic problems are considered.
In the past few years, increasing numbers of automatic warehousing systems using computer-controlled stacker cranes have been installed. Our research concerns the scientific scheduling and design of these systems. There … In the past few years, increasing numbers of automatic warehousing systems using computer-controlled stacker cranes have been installed. Our research concerns the scientific scheduling and design of these systems. There are three elements to scheduling: the assignment of multiple items to the same pallet (Pallet Assignment); the assignment of pallet loads to storage locations (Storage Assignment); and rules for sequencing storage and retrieve requests (Interleaving). This paper deals with optimal storage assignment. Results are obtained which compare the operating performance of three storage assignment rules: random assignment, which is similar to the closest-open-location rule used by many currently operating systems; full turnover-based assignment: and class-based turnover assignment. It is shown that significant reductions in crane travel time (and distance) are obtainable from turnover-based rules. These improvements can, under certain circumstances, be directly translated into increased throughput capacity for existing systems, and may be used to alter the design (e.g., size and number of racks, speed of cranes, etc.) of proposed systems in order to achieve a more desirable system balance between throughput and storage capacity.
The paper is concerned with the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. … The paper is concerned with the optimum routing of a fleet of gasoline delivery trucks between a bulk terminal and a large number of service stations supplied by the terminal. The shortest routes between any two points in the system are given and a demand for one or several products is specified for a number of stations within the distribution system. It is desired to find a way to assign stations to trucks in such a manner that station demands are satisfied and total mileage covered by the fleet is a minimum A procedure based on a linear programming formulation is given for obtaining a near optimal solution. The calculations may be readily performed by hand or by an automatic digital computing machine. No practical applications of the method have been made as yet. A number of trial problems have been calculated, however.
A new cluster-analysis method, the bond energy algorithm, has been developed recently; it operates upon a raw input object-object or object-attribute data array by permuting its rows and columns in … A new cluster-analysis method, the bond energy algorithm, has been developed recently; it operates upon a raw input object-object or object-attribute data array by permuting its rows and columns in order to find informative variable groups and their interrelations. This paper describes the algorithm and illustrates by several examples its use for both problem decomposition and data reorganization.
In recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures that can solve complex problems. We describe a distributed … In recent years, there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures that can solve complex problems. We describe a distributed heuristic algorithm that was inspired by the observation of the behavior of ant colonies, and we propose its use for the quadratic assignment problem. The results obtained in solving several classical instances of the problem are compared with those obtained from other evolutionary heuristics to evaluate the quality of the proposed system.
Abstract The paper provides a comprehensive review of the various approaches that have been adopted in an attempt to solve the problem of forming machines into groups and components into … Abstract The paper provides a comprehensive review of the various approaches that have been adopted in an attempt to solve the problem of forming machines into groups and components into associated families in Group Technology, A new and more efficient version of the previously published ROC algorithm, implemented interactively, is described together with a new relaxation procedure for bottleneck machines.
This paper presents a detailed survey of the research on warehouse design, performance evaluation, practical case studies, and computational support tools. This and an earlier survey on warehouse operation provide … This paper presents a detailed survey of the research on warehouse design, performance evaluation, practical case studies, and computational support tools. This and an earlier survey on warehouse operation provide a comprehensive review of existing academic research results in the framework of a systematic classification. Each research area within this framework is discussed, including the identification of the limits of previous research and of potential future research directions.
We develop and test a method for the uncapacitated facility location problem that is based on a linear programming dual formation. A simple ascent and adjustment procedure frequently produces optimal … We develop and test a method for the uncapacitated facility location problem that is based on a linear programming dual formation. A simple ascent and adjustment procedure frequently produces optimal dual solutions, which in turn often correspond directly to optimal integer primal solutions. If not, a branch-and-bound procedure completes the solution process. This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required. Computational tests on problems with as many as 100 potential facility locations provide evidence that this approach is superior to several other methods.
Industry 4.0 is the fourth industrial revolution that was first introduced in Germany. This paper presents a review on the advances of robotic and automation technology in achieving industry 4.0. … Industry 4.0 is the fourth industrial revolution that was first introduced in Germany. This paper presents a review on the advances of robotic and automation technology in achieving industry 4.0. Many companies, research centers, and universities acknowledge that robotics and automation technology is the basis of industrial manufacturing and an important driver for Industry 4.0. Hopefully, from this report, engineering students would be exposed to new inventions of technology revolution as well as to create the business mind for a better future.
The aim of this book is to cover various aspects of the Production and Operations Analysis. Apart from the introduction to basic understanding of each topic, the book will also … The aim of this book is to cover various aspects of the Production and Operations Analysis. Apart from the introduction to basic understanding of each topic, the book will also provide insights to various conventional techniques as well as, various other mathematical and nature-based techniques extracted from the existing literature. Concepts like smart factories, intelligent manufacturing, and various techniques of manufacturing will also be included. Various types of numerical examples will also be presented in each chapter and the descriptions will be done in lucid style with figures, point-wise descriptions, tables, pictures to facilitate easy understanding of the subject.
This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since … This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics. Originally published in 1962. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.
| International Research Journal of Modernization in Engineering Technology and Science
The increasing adoption of industrial robots has significantly advanced manufacturing efficiency and flexibility. However, this expansion introduces new energy consumption challenges, especially as electricity has become the dominant energy source … The increasing adoption of industrial robots has significantly advanced manufacturing efficiency and flexibility. However, this expansion introduces new energy consumption challenges, especially as electricity has become the dominant energy source in automated systems. As the industrial sector faces rising energy costs and ambitious sustainability goals, understanding and minimizing the energy consumption of robotic systems is imperative. This review presents a structured analysis of energy consumption in industrial robots, linking mechanical design, actuation systems, and control strategies to their energetic effects. We first discuss different industrial robot types and their kinematic configurations, identifying how structural characteristics influence energy use. The article then categorizes energy consumption optimization strategies into software-based and hardware-based approaches. A comparative SWOT analysis highlights the strengths and limitations of each approach. The review also explores emerging trends such as DC microgrid integration. The future directions underline the need for standardized energy assessment frameworks and the development of hybrid optimization strategies that combine the reviewed approaches, suitable for being applied in real-world industrial robot applications. This work provides a comprehensive foundation for establishing best practices in energy consumption optimization for industrial robots.
Efficient material handling is crucial in the logistics operations of modern salt warehouses, where Rail Guided Vehicles (RGVs) and Air Sorting Robots (ASRs) are often deployed to manage inbound and … Efficient material handling is crucial in the logistics operations of modern salt warehouses, where Rail Guided Vehicles (RGVs) and Air Sorting Robots (ASRs) are often deployed to manage inbound and outbound tasks. However, as the number of tasks increases within a given period, conflicts and deadlocks between simultaneously operating RGVs and ASRs become more frequent, reducing efficiency and increasing energy consumption during transportation. To address this, the research frames the inbound and outbound problem as a task allocation issue for the RGV/ASR system with a finite buffer, and proposes a collision avoidance strategy and a zero-wait strategy for loaded machines to reallocate tasks. To improve computational efficiency, we introduce an adaptive multi-neighborhood hybrid search (AMHS) algorithm, which integrates a dual-sequence coding scheme and an elite solution initialization strategy. A dedicated global search operator is designed to expand the search landscape, while an adaptive local search operator, inspired by biological hormone regulation mechanisms, along with a perturbation strategy, is used to refine the local search. In a case study on packaged salt storage, the proposed AMHS algorithm reduced the total makespan by 30.1% compared to the original task queue. Additionally, in 15 randomized test scenarios, AMHS demonstrated superior performance over three benchmark algorithms—Genetic Algorithm (GA), Discrete Imperialist Competitive Algorithm (DICA), and Improved Whale Optimization Algorithm (IWOA)—achieving an average makespan reduction of 12.6% relative to GA.
Robotic-based sorting systems offer an innovative solution to enhance efficiency and accuracy in the logistics industry. This research aims to design and implement a robotic system capable of automatically sorting … Robotic-based sorting systems offer an innovative solution to enhance efficiency and accuracy in the logistics industry. This research aims to design and implement a robotic system capable of automatically sorting goods by integrating barcode scanning technology and line tracer navigation. The system is built using an Arduino Mega 2560 as the main controller and is equipped with Stepper motors, DC motors, mecanum wheels, a GM65 barcode scanner, and various supporting actuators.Experimental results show that the GM65 sensor can optimally read barcodes at distances ranging from 15 to 55 cm. The servo motor demonstrates an accuracy rate of over 98%, while the Stepper motor performs optimally at a minimum voltage of 9.0 V. Additionally, line sensor calibration yields a threshold range between 528 and 573, ensuring accurate line detection. The system also exhibits stable movement with consistent speed and minimal travel time variation, indicating efficient operational performance.By integrating these technologies, the developed robotic sorter system significantly improves productivity, accuracy, and reliability in automated goods sorting processes. The implementation of this system is expected to support automation in the logistics sector and provide a practical solution to distribution management challenges in the era of Industry 4.0.
Satya Venkata Naga Ganesh Nanduri | International Journal of Innovative Research in Engineering & Multidisciplinary Physical Sciences
Organizations shift from outdated or homegrown ERPs to robust ERP Platforms such as S4HANA to address various challenges such as need for an integrated application that can handle all the … Organizations shift from outdated or homegrown ERPs to robust ERP Platforms such as S4HANA to address various challenges such as need for an integrated application that can handle all the functions that an organization needs, requirements for real-time reporting, security considerations, compatibility with various external applications or platforms, obligation to quickly adopting to changing legal or statutory regulations.Companies decided to move to any other ERP has to go through migration process which is a complex task as this requires extracting all the data from legacy applications, map them to new ERP attributes, decide on the strategy to migrate, migrate them to new ERP system and reconciling the migrated data between Legacy systems and S4HANA. This article provides insights into what are different types of SAP implementation methodologies, what is migration and a strategy that was proven successful in migrating Purchase Orders from legacy systems to S4HANA.
Neerav Verma | International Scientific Journal of Engineering and Management
Abstract This study investigates the key logistics and warehouse management challenges faced by Amazon, one of the world’s leading e-commerce platforms. With rapid growth and global expansion, Amazon has developed … Abstract This study investigates the key logistics and warehouse management challenges faced by Amazon, one of the world’s leading e-commerce platforms. With rapid growth and global expansion, Amazon has developed a highly complex logistics network involving systems such as Fulfillment by Amazon (FBA), Multi-Channel Fulfillment (MCF), and Amazon Warehousing and Distribution (AWD). Despite these advancements, the company continues to face operational difficulties related to last-mile delivery, labor turnover, inventory accuracy, and scalability during seasonal peaks. The research adopted a secondary data analysis approach, using industry reports, academic literature, and real-world case studies to explore these challenges and assess Amazon’s strategic responses. Key findings highlight the company’s reliance on automation, AI, and robotics to enhance efficiency and maintain customer satisfaction. However, persistent issues like workforce management and safety under high pressure remain areas of concern. This dissertation contributes to the broader understanding of how global e-commerce giants manage complex supply chain operations. It also provides actionable insights for logistics managers, supply chain strategists, and policymakers seeking to optimize warehouse performance and customer fulfillment. The findings may serve as a foundation for further primary research or comparative studies in the evolving logistics and e-commerce landscape.
The study focuses on the redesign of the plant layout of a glass manufacturing company using the systematic layout planning (SLP) methodology and discrete event simulation (DES). Deficiencies in the … The study focuses on the redesign of the plant layout of a glass manufacturing company using the systematic layout planning (SLP) methodology and discrete event simulation (DES). Deficiencies in the current layout were identified, such as inefficient material flows and excessive distances travelled by workers. Detailed data on dimensions and operating times were collected and analysed using tools such as Stat-Fit to statistically validate the data and simulate it in FlexSim V 22.2.0. The SLP methodology allowed the identification of relationships between areas and the proposal of three alternative layout designs. The selected layout, with 90% material flow efficiency, significantly reduced the distances travelled by operators and improved organisation and location. Simulation results showed an average reduction of 52% in the distances travelled by workers, as well as a better distribution of workloads. This study demonstrates how the integration of simulation and systematic planning tools can improve operational efficiency and productivity in manufacturing companies.
| International journal of intelligent engineering and systems
PT XYZ adalah perusahaan yang bergerak dibidang jasa (trading) yang menyuplai part automotive roda dua dan empat. Umumnya aktivitas gudang terdiri dari receiving, storage, picking, packing dan delivery. Seiring gencarnya … PT XYZ adalah perusahaan yang bergerak dibidang jasa (trading) yang menyuplai part automotive roda dua dan empat. Umumnya aktivitas gudang terdiri dari receiving, storage, picking, packing dan delivery. Seiring gencarnya kampanye pentingnya penerapan konsep green industry, maka PT XYZ mengembangkan sistem manajemen gudang untuk memenuhi kebutuhan bisnis dimasa depan. Sistem ini mencakup aplikasi seluler untuk manajemen inventaris, pemindaian barcode, pelacakan inventaris, dan verifikasi proses. Aplikasi mobile scanner dirancang untuk menyediakan fungsi pemindaian barcode untuk manajemen inventaris di gudang. Aplikasi tersebut akan diinstal pada Cloud Server PT XYZ, yang terdiri dari aplikasi mobile, aplikasi web, dan database. Aplikasi mobile akan terintegrasi dengan aplikasi business central, sedangkan aplikasi web akan dapat diakses melalui browser dengan format HTML5. Database akan diinstal pada cloud server, memungkinkan konektivitas internet di seluruh gudang. Penerapan warehouse management system di PT XYZ ini bertujuan untuk mengoptimalkan proses bisnis sekaligus melakukan penghematan biaya produksi dan energi listrik yang merupakan tujuan dari konsep green industry. Hasil penelitian ini menunjukkan penggunaan energi listrik mengalami penghematan hingga 96% dan juga penurunan pengeluaran biaya dalam satu tahun sebesar Rp 2.099.212.800,-.
This project outlines the creation of a computer vision-based robotic arm through a systematic approach. The design and implementation of the robotic arm integrates a computer vision system to automate … This project outlines the creation of a computer vision-based robotic arm through a systematic approach. The design and implementation of the robotic arm integrates a computer vision system to automate complex tasks that further enhance the precision and adaptability of the system. Moreover, the integration of the camera makes the system more advanced, as image processing and image segmentation allow the machine to perform under different circumstances and adapt to new scenarios. Such systems can be used in various fields such as healthcare and gas station.
This paper proposes a procedure for implementing a robotic system in a plasma cutting workplace. The goal is to create an efficient and safe process for integrating a robot into … This paper proposes a procedure for implementing a robotic system in a plasma cutting workplace. The goal is to create an efficient and safe process for integrating a robot into the existing workspace, with an emphasis on increasing productivity and minimising the risk of human factors. The paper includes an analysis of the requirements for the robotic system, including compatibility with the plasma cutting equipment. The proposed procedure involves an analysis of the current state of the workplace, followed by recommended implementation steps. The procedure includes a comparison of the current state of the workplace with the proposed state and the establishment of criteria for evaluation, which are subsequently used in the techno-economic evaluation. The paper also presents an industrial case study to validate the proposed procedure.
Renlong Han , Jianxin Wang , Jia-Rui Zhou +1 more | International Conference on Frontiers of Traffic and Transportation Engineering (FTTE 2022)
Jie Wang , Ting Wang | International Conference on Frontiers of Traffic and Transportation Engineering (FTTE 2022)
Xiangyi Chen , Chuang Wang , H.S. Chen | International Conference on Frontiers of Traffic and Transportation Engineering (FTTE 2022)
In this work, we aim to adjust vehicle speeds in real time by predicting the surrounding population density based on the spacing of customer locations. We comprehensively consider fixed costs, … In this work, we aim to adjust vehicle speeds in real time by predicting the surrounding population density based on the spacing of customer locations. We comprehensively consider fixed costs, cargo loss costs, fuel costs, penalty costs, and environmental costs; build a cold chain distribution vehicle path optimization model with the goal of minimizing the total cost and maximizing customer satisfaction; and design a hybrid genetic algorithm solution optimization model. The algorithm dynamically adjusts the tournament scale through the standard deviation of the fitness value, uses the OX cross operator, determines the position of variation based on the customer information matrix, and performs local search optimization with the removal and insertion operators. Through comparison to other algorithms in the literature, the results show that the hybrid genetic algorithm not only improves customer satisfaction, but also maintains a lower total cost, which is obviously superior when solving the complex cold chain distribution path optimization problem; further comparison and analysis of the mathematical model in this paper with the single-dimension satisfaction model reveals that under the same satisfaction constraint threshold, the model in this paper can significantly reduce the system operating cost; we also deeply discuss the influence mechanism of vehicle traveling mode and customer point sparsity radius on distribution path planning.
Manual finishing operations in aerospace and ground transportation industries are often associated with health-and-safety-related issues such as musculoskeletal disorders, productivity loss, and challenges in workforce renewal. This work presents an … Manual finishing operations in aerospace and ground transportation industries are often associated with health-and-safety-related issues such as musculoskeletal disorders, productivity loss, and challenges in workforce renewal. This work presents an innovative automated solution to address these challenges, prioritizing the ease of implementation and affordability for small and midsize enterprises (SMEs). Our proposed solution is a collaborative robotic (cobotic) finishing platform designed to eliminate labor-intensive work while keeping human operators in the loop to manage unforeseen situations. This platform aims to eliminate health risks, enhance repeatability, improve product quality, and increase productivity. This paper describes the mechanical design of the platform, its embedded cyber-physical system (CPS), interactivity features, as well as its risk assessment and risk mitigation. The platform integrates a UR10 cobot mounted upside down on a gantry structure to expand workspace, along with 3D sensors, scene cameras, compliance end-effectors, a dust collection system, programmable logic controllers (PLCs), and augmented reality projectors to assist the operator for easy execution of finishing tasks. The CPS comprises interconnected physical twins, their models, and relevant packages for the control of the whole finishing process from PLC to autonomous robot programming. Safety measures, including safety-rated devices, attenuation measures, and personal protective equipment, are integrated to ensure operator’s safety. While many research streams are fully integrated into the platform and CPS, some are still in the process of integration. Despite this, various finishing tasks have been successfully executed using the platform, demonstrating its potential to transform metal part finishing processes in industry.
For the requirements of future spacecraft including flexible launch base, long window period, multi-purpose, module reorganization, space-sky fusion, wide-domain operation, this paper designs a two-stage repeatable space transporter, with a … For the requirements of future spacecraft including flexible launch base, long window period, multi-purpose, module reorganization, space-sky fusion, wide-domain operation, this paper designs a two-stage repeatable space transporter, with a payload of 10 tons. To meet the requirements of wide-domain flight, a power system and aerodynamic layout are designed for subsonic, transonic, supersonic, and hypersonic conditions. Additionally, the electromagnetic, aerodynamic, mechanical coupling guideway separation guide rail are developed along with corresponding flight control systems for the two class vehicles. The staged force unloading is realized when the two vehicles are separated, reducing the burst dynamics impact. Finally, the design of the positive and passive thermal control system and the aircraft’s body structure enables high-speed, high-energy reentry and return. The two-class space transporter can be launched from any airport with a capacity exceeding 4E, establishing an extensive launch network. Through modular reconfiguration, this versatile transporter can efficiently accomplish diverse tasks, offering a promising solution for future aerospace.
RITIK KUMAR JAISWAL | INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT
ABSTRACT This research paper explores the critical role of inventory management in the FMCG (Fast-Moving Consumer Goods) sector Warehouse in FC. It focuses on how effective inventory practices contribute to … ABSTRACT This research paper explores the critical role of inventory management in the FMCG (Fast-Moving Consumer Goods) sector Warehouse in FC. It focuses on how effective inventory practices contribute to operational efficiency, cost control, and customer satisfaction. The study examines key inventory strategies, the impact of digital transformation, and challenges faced by FMCG companies-especially in India. Case studies of firms such as Hindustan Unilever Limited (HUL), Nestlé India, and Dabur highlight practical insights into best practices. This paper offers a roadmap for inventory optimization through technology, strategic alignment, and sustainability.
Efficient facility layout design is crucial for optimizing operations, reducing costs, and enhancing productivity in manufacturing environments. This study focuses on evaluating and prioritizing layout alternatives for a furniture manufacturing … Efficient facility layout design is crucial for optimizing operations, reducing costs, and enhancing productivity in manufacturing environments. This study focuses on evaluating and prioritizing layout alternatives for a furniture manufacturing facility in Türkiye. An integrated decision-making methodology combining fuzzy AHP (analytic hierarchy process) and fuzzy EDAS (evaluation based on distance from average solution) is employed to solve the problem. The fuzzy AHP procedure is applied to assess the importance of criteria influencing facility layout decisions. The fuzzy EDAS procedure is used to evaluate and rank facility layout alternatives. To support the model results, a comparative analysis using fuzzy ARAS and a sensitivity analysis based on weight variations are conducted. Flexibility emerges as the most important criterion with a weight of 35.56%. Among the alternatives, layout option A3 demonstrates the best performance with a score of 0.9872, corresponding to a 68.28% share. The study results demonstrate significant operational improvements, including reduced production distances, enhanced energy efficiency, minimized bottlenecks, and accelerated assembly processes. This research serves as a valuable reference for addressing similar optimization challenges across various industries.
This paper presents a novel, measurement-driven method for the simultaneous estimation of the User Coordinate System (UCS) and Tool Center Point (TCP) in industrial robot systems, formulated as a solution … This paper presents a novel, measurement-driven method for the simultaneous estimation of the User Coordinate System (UCS) and Tool Center Point (TCP) in industrial robot systems, formulated as a solution to the AX = YB calibration problem. The proposed algorithm minimizes the discrepancy between simulated and real-world robot poses by iteratively refining both coordinate transformations using external laser tracker measurements. A comparative evaluation was conducted using two ABB IRB-6640 robots and four calibration strategies, including internal three-point measurement, absolute orientation, geometrical referencing, and the proposed method. Experimental results show that the proposed approach outperforms standard industrial techniques, achieving an average translational error below 0.4 mm, compared to over 2 mm for conventional methods. The geometric method, while widely used for its simplicity, demonstrated the highest error and instability due to poor rotational alignment. The findings validate the proposed solution as an accurate, non-invasive alternative for implementing simulated programs in real production environments, particularly where direct access to robot controllers is limited.
Koushik Pal | International Journal for Research in Applied Science and Engineering Technology
In modern era of smart homes and automation, the Artificial Intelligence (AI) create a revolutions. It makes the home appliances very unique and innovative. AI enhances the power of simple … In modern era of smart homes and automation, the Artificial Intelligence (AI) create a revolutions. It makes the home appliances very unique and innovative. AI enhances the power of simple household appliances to fast our life. Traditional washing machines require manual input for selecting wash cycles, load types, and water levels. This is not that much easy for users to control it . It has very complicated algorithm for users.This paves the way for an innovative solution: an AI-based washing machine that enhances user convenience, optimizes washing efficiency, and conserves water and energy. The motivation behind this project is found from the raped increasing demand for AI in home appliances that can emphasis the power of household appliances and make very adaptable for users .By incorporating AI algorithms, sensors, and microcontroller-based automation, we aim to develop a washing system that not only simplifies the washing process but also reduces human error and promotes sustainable usage which is very suitable for user's applications. It not only emphasis the washing process it also enhance the speed of a traditional washing machine. The primary goal of this project is to design and implement a smart AI washing machine with a user input using capacitive touch sensor to initiate the wash cycle. As environmental concerns rise and smart living becomes a trend, this type of system aligns perfectly with global sustainability goals.
The increasing crisis of clean water availability and pollution in urban drainage systems has become a pressing concern. This study aims to analyze the performance and optimize a real-time-based robotic … The increasing crisis of clean water availability and pollution in urban drainage systems has become a pressing concern. This study aims to analyze the performance and optimize a real-time-based robotic system for clean water filtration in drainage channels. The proposed robotic system integrates smart sensors for automated waste detection and collection, and is operated remotely via the Internet of Things (IoT) platform. The methodology includes system testing under various drainage conditions, with an emphasis on evaluating waste processing capacity and identifying key performance-influencing factors such as sensor stability and robotic design. Preliminary findings indicate that the robot can enhance filtration efficiency by up to 30%. However, certain limitations were observed, including disruptions in ultrasonic sensor functionality due to loose jumper wires, and operational constraints under adverse weather conditions caused by the robot's non-waterproof design. Real-time simulation results demonstrate that the system is capable of effective operation under specific scenarios, although further improvements are needed to enhance sensor reliability and weather resistance. This research is expected to contribute to the advancement of robotic technologies for more efficient and environmentally sustainable clean water management
The accuracy of localization for Automated Guided Vehicles (AGVs) is a critical factor influencing their operational efficiency, safety, and the overall performance of automated systems. Visual localization for AGVs faces … The accuracy of localization for Automated Guided Vehicles (AGVs) is a critical factor influencing their operational efficiency, safety, and the overall performance of automated systems. Visual localization for AGVs faces several challenges, including sensitivity to lighting variations, vulnerability to environmental changes, and computational demands that may impede real-time performance. Therefore, research into the visual localization of AGVs holds substantial practical significance, and employing monocular vision localization can effectively reduce localization costs. Differing from traditional localization methods, the proposed approach is a monocular vision localization technique that leverages visual beacons, providing significant technical advantages. At present, research on pure visual localization for AGVs remains relatively scarce. Employing monocular vision localization presents a viable approach to effectively reducing equipment costs. Studying this approach has theoretical significance and provides valuable guidance for enhancing its practical application. By strategically placing visual beacons on the AGV and performing camera calibration, a monocular camera is utilized to capture, recognize, locate, and estimate the posture of these beacons. Taking variables such as lighting conditions into consideration, a rigorous experimental design was formulated to validate the feasibility of the proposed methodology. Comprehensive experiments were conducted to evaluate the proposed localization approach, confirming that the AGV’s precision, pose estimation capability, and real-time performance meet the requirements of the specified application scenarios. The presented method exhibits significant potential for practical deployment. Compared to previous methods, this approach achieves the required localization accuracy while reducing deployment costs and enhancing real-time performance.
In inventory management, storage capacity constraints complicate multi-item lot-sizing decisions. As the number of items increases, deciding how much of each item to order without exceeding capacity becomes more difficult. … In inventory management, storage capacity constraints complicate multi-item lot-sizing decisions. As the number of items increases, deciding how much of each item to order without exceeding capacity becomes more difficult. Dynamic programming works efficiently for a single item, but when capacity constraints are nearly minimal across multiple items, novel heuristics are required. However, previous heuristics have mainly focused on inventory bound constraints. Therefore, this paper introduces push and pull heuristics to solve the multi-item uncapacitated lot-sizing problem under near-minimal capacities. First, a dynamic programming approach based on a network flow model was used to generate the initial replenishment plan for the single-item lot-sizing problem. Next, under storage capacity constraints, the push operation moved the selected replenishment quantities from the current period to subsequent periods to meet all demand requirements. Finally, the pull operation shifted the selected replenishment quantities from the current period into earlier periods, ensuring that all demand requirements were satisfied. The results of the random experiment showed that the proposed heuristic generated solutions whose performance compared well with the optimal solution. This heuristic effectively solves all randomly generated instances representing worst-case conditions, ensuring robust operation under near-minimal storage. For large-scale problems under near-minimal storage capacity constraints, the proposed heuristic achieved only small optimality gaps while requiring less running time. However, small- and medium-scale problems can be solved optimally by a Mixed-Integer Programming (MIP) solver with minimal running time.
This study improves the exploration of ant colony optimization (ACO) ability by adapting it with the Sequential Variable Neighbourhood Search Change Step (SVNSCS) algorithm as post-improvements for solving the Capacitated … This study improves the exploration of ant colony optimization (ACO) ability by adapting it with the Sequential Variable Neighbourhood Search Change Step (SVNSCS) algorithm as post-improvements for solving the Capacitated Vehicle Routing Problem (CVRP) in solid waste collection methodology. The aim is to reduce the cost of waste collection by minimizing the route distance and the number of vehicles to serve all containers within the route. Technically, SVNSCS explores the search space depending on the information associated with the demands and coordinates of the nodes. Based on the result, the proposed algorithm demonstrates its superiority over the traditional ACO algorithm by having 66.7%, 81.81%, 62.5%, and 77.77% in terms of the best solution for four CVRP benchmark datasets of A, B, E, and P, respectively. Each dataset has different characteristics, such as the number of containers, vehicle capacity, objective function, weight of each container, and geographical distribution.
The competitive landscape for businesses is expanding rapidly, keeping pace with the swift development of the global economy [...] The competitive landscape for businesses is expanding rapidly, keeping pace with the swift development of the global economy [...]
With the increasing demand for takeaway delivery, more merchants are developing their takeaway delivery system to manage order fulfillment and enhance the consumer online experience. This study presents a mathematical … With the increasing demand for takeaway delivery, more merchants are developing their takeaway delivery system to manage order fulfillment and enhance the consumer online experience. This study presents a mathematical model for merchant-operated takeaway delivery, using an improved ant colony algorithm integrated with K-means to cluster customer locations and determine optimal routes. We propose two fairness strategies—order quantity and travel distance—to ensure equitable workload distribution among riders. The K-means algorithm is enhanced by reallocating cluster assignments based on the nodes’ distances to all cluster centers. The simulation results demonstrate that the designed algorithm and strategies generate efficient optimal delivery plans for merchants.
The purpose of this study is the mathematical modelling of electromechanical processes to estimate the electricity consumption of an automated shuttle warehouse system. In the form of a system of … The purpose of this study is the mathematical modelling of electromechanical processes to estimate the electricity consumption of an automated shuttle warehouse system. In the form of a system of two ordinary differential equations with initial conditions, it is proposed the mathematical model allowing to study the processes of electric energy consumption by an automated shuttle with direct current motors, which is used as the automation tools in modern warehouse systems for transporting goods between racks. The proposed mathematical model allows us to determine the angular velocity of the shuttle wheels and the current in the rotor windings of its driving electric motors for a given supplied electric voltage. The process of electric energy consumption is characterized by the current in the rotor windings of the driving electric motors of the shuttle and their supplied voltage. By means the proposed mathematical model, the process of energy consumption is researched for the automated shuttle accelerated from the state of the rest to achieving of the steady speed under an instantaneously supplied constant electric voltage. The considered example shows that the proposed model allows us to study both transient and steady processes of electric energy consumption by a shuttle with direct current motors when transporting goods between racks of a warehouse system.