首页 > 最新文献

2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)最新文献

英文 中文
The lexicographical capacitated vehicle routing problem 词典化的车辆路径问题
Zuzana Borčinová, S. Pesko
The objective of the Capacitated Vehicle Routing Problem is to find routes with minimal cost for a homogeneous fleet of vehicles to serve all the customers, without violating the capacity of the vehicles. Usually, in the basic version of the problem a set of identical vehicles, with a known capacity, is available at the depot and additional objective requiring the minimization of the number of used vehicles. If the number of vehicles to be used is fixed, we may require to minimize the maximum load of vehicles. In this paper we examine the CVRP with fixed number of vehicles with equal capacity and two main goals: the first is to minimize the capacity of the vehicles and the second is to minimize the total travel cost. This variant of the CVRP we call the Lexicographical Capacitated Vehicle Routing Problem.
有能力车辆路线问题的目标是在不违反车辆容量的情况下,以最小的成本为同质车队找到服务所有客户的路线。通常,在这个问题的基本版本中,在仓库有一组相同的车辆,具有已知的容量,并且额外的目标要求尽量减少二手车的数量。如果要使用的车辆数量是固定的,我们可能需要最小化车辆的最大负载。本文研究了等量车辆数量固定的CVRP,主要目标有两个:一是车辆容量最小,二是总出行成本最小。我们将CVRP的这种变体称为词典法有能力车辆路线问题。
{"title":"The lexicographical capacitated vehicle routing problem","authors":"Zuzana Borčinová, S. Pesko","doi":"10.1109/SOLI.2017.8120975","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120975","url":null,"abstract":"The objective of the Capacitated Vehicle Routing Problem is to find routes with minimal cost for a homogeneous fleet of vehicles to serve all the customers, without violating the capacity of the vehicles. Usually, in the basic version of the problem a set of identical vehicles, with a known capacity, is available at the depot and additional objective requiring the minimization of the number of used vehicles. If the number of vehicles to be used is fixed, we may require to minimize the maximum load of vehicles. In this paper we examine the CVRP with fixed number of vehicles with equal capacity and two main goals: the first is to minimize the capacity of the vehicles and the second is to minimize the total travel cost. This variant of the CVRP we call the Lexicographical Capacitated Vehicle Routing Problem.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129556556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Appropriate number of emergency medical service stations 适当数量的紧急医疗服务站
M. Janackova, A. Szendreyova
In this article, a hypothesis about the suitable number of the Emergency medical stations (EMS) is pronounced. The hypothesis says, that addition or building another EMS station is meaningful only when the benefit does not fall below the average contribution which is calculated from the various options. To increase the availability of the intervention of the EMS, a larger number of the Emergency medical services stations is necessary. But mainly for the economic perspective, it is not possible arbitrarily to increase their number. The aim of this article is to test some parameter settings that have an impact on the calculation of the suitable number of the Emergency medical services stations in regions of the Slovak Republic.
本文提出了应急医疗站适宜数量的假设。该假设认为,只有当效益不低于从各种选择中计算出来的平均贡献时,增加或建造另一个EMS站才有意义。为了增加紧急医疗服务的可用性,需要更多的紧急医疗服务站。但主要从经济角度来看,不可能随意增加它们的数量。本文的目的是测试对斯洛伐克共和国各地区紧急医疗服务站适当数量的计算有影响的一些参数设置。
{"title":"Appropriate number of emergency medical service stations","authors":"M. Janackova, A. Szendreyova","doi":"10.1109/SOLI.2017.8120968","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120968","url":null,"abstract":"In this article, a hypothesis about the suitable number of the Emergency medical stations (EMS) is pronounced. The hypothesis says, that addition or building another EMS station is meaningful only when the benefit does not fall below the average contribution which is calculated from the various options. To increase the availability of the intervention of the EMS, a larger number of the Emergency medical services stations is necessary. But mainly for the economic perspective, it is not possible arbitrarily to increase their number. The aim of this article is to test some parameter settings that have an impact on the calculation of the suitable number of the Emergency medical services stations in regions of the Slovak Republic.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131956187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A multi-objective formulation for multimodal transportation network's planning problems 多式联运网络规划问题的多目标公式
M. Mnif, Sadok Bouamama
Multimodal transport offers an advanced platform for more efficient, reliable, flexible and sustainable freight transport. In order to achieve sustainable planning in a complicated transport system, it is very interesting to use methods include in the fields of operational research. In this article, we propose a mathematical model to solve the multi-objective optimization problem applied in the multimodal transport network. In this paper, we will start with a brief description of the existing literature works that interested in the optimization problem as well as the planning of the multimodal transport network. The goal of this study will be helping to propose an efficient mathematical model. Indeed, the main proposal of the article is a multi-objective programming model with linear and nonlinear constraints. Computational experiments are carried out to test the effectiveness of the proposed model, which has been proved by a comparison with the literature model.
多式联运为更高效、可靠、灵活和可持续的货物运输提供了一个先进的平台。为了在复杂的交通系统中实现可持续规划,使用运筹学领域的方法是非常有趣的。本文提出了一个求解多式联运网络中多目标优化问题的数学模型。在本文中,我们将首先简要介绍对多式联运网络优化问题和规划感兴趣的现有文献作品。这项研究的目的是帮助提出一个有效的数学模型。实际上,本文的主要建议是一个具有线性和非线性约束的多目标规划模型。通过计算实验验证了所提模型的有效性,并与文献模型进行了比较。
{"title":"A multi-objective formulation for multimodal transportation network's planning problems","authors":"M. Mnif, Sadok Bouamama","doi":"10.1109/SOLI.2017.8120985","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120985","url":null,"abstract":"Multimodal transport offers an advanced platform for more efficient, reliable, flexible and sustainable freight transport. In order to achieve sustainable planning in a complicated transport system, it is very interesting to use methods include in the fields of operational research. In this article, we propose a mathematical model to solve the multi-objective optimization problem applied in the multimodal transport network. In this paper, we will start with a brief description of the existing literature works that interested in the optimization problem as well as the planning of the multimodal transport network. The goal of this study will be helping to propose an efficient mathematical model. Indeed, the main proposal of the article is a multi-objective programming model with linear and nonlinear constraints. Computational experiments are carried out to test the effectiveness of the proposed model, which has been proved by a comparison with the literature model.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132373592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Actors interactions and needs in the European electromobility network 欧洲电动汽车网络的参与者互动和需求
M. P. Fanti, G. Pedroncelli, M. Roccotelli, S. Mininel, G. Stecco, W. Ukovich
The standardization of services in the European electromobility network is becoming one of the main goal of researchers and practitioners. In this context, the objective of the paper is proposing a general view of the main needs and functions of the involved actors and stakeholders, and to state their interactions within the electromobility network. In particular, actors and stakeholders are grouped in so called macro-areas, and the interoperability and cooperation at both macro-areas and actors levels are provided by means of Unified Modeling Language (UML) diagrams.
欧洲电动汽车网络服务的标准化正成为研究人员和实践者的主要目标之一。在这种情况下,本文的目的是提出有关参与者和利益相关者的主要需求和功能的一般观点,并说明他们在电动汽车网络中的相互作用。特别地,参与者和涉众被分组在所谓的宏观领域中,并且在宏观领域和参与者级别上的互操作性和合作是通过统一建模语言(UML)图的方式提供的。
{"title":"Actors interactions and needs in the European electromobility network","authors":"M. P. Fanti, G. Pedroncelli, M. Roccotelli, S. Mininel, G. Stecco, W. Ukovich","doi":"10.1109/SOLI.2017.8120988","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120988","url":null,"abstract":"The standardization of services in the European electromobility network is becoming one of the main goal of researchers and practitioners. In this context, the objective of the paper is proposing a general view of the main needs and functions of the involved actors and stakeholders, and to state their interactions within the electromobility network. In particular, actors and stakeholders are grouped in so called macro-areas, and the interoperability and cooperation at both macro-areas and actors levels are provided by means of Unified Modeling Language (UML) diagrams.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
A method for estimating annual cost reduction of IT service deals 一种估算IT服务交易年度成本降低的方法
Kugamoorthy Gajananan, Aly Megahed, Shubhi Asthana, V. Becker, Taiga Nakamura, Mark A. Smith
Highly valued Information technology (IT) service contracts involve the delivery of complex IT services, such as migrating the client's IT infrastructure to the Cloud, Mainframes, among others. IT service providers usually compete to win these IT service contracts. In order to bid on such deals, IT service providers need to price/quote the solution that they propose to the client, trying to convince him to use their services. A few analytical methods in the literature have been provided for pricing these deals. However, these methods ignore an important characteristic of these services; that is they are typically characterized by a decreasing cost profile in subsequent years to the first year. Typically, these methods require solutioners to manually input these annual cost reductions. In this paper, we present an analytical way for calculating this cost reduction, if applicable, via mining historical data. We show that using our methodology could achieve significant increase in the accuracy of estimating the costs and prices of IT service deals.
高价值的信息技术(IT)服务合同涉及复杂IT服务的交付,例如将客户的IT基础设施迁移到云、大型机等。IT服务提供商通常会竞争赢得这些IT服务合同。为了竞标此类交易,IT服务提供商需要对他们向客户提出的解决方案进行定价/报价,试图说服客户使用他们的服务。文献中已经提供了一些分析方法来为这些交易定价。然而,这些方法忽略了这些服务的一个重要特征;也就是说,它们的典型特点是在随后几年的成本概况比第一年下降。通常,这些方法需要解决方案提供商手动输入这些年度成本降低量。在本文中,我们提出了一种通过挖掘历史数据来计算成本降低的分析方法。我们表明,使用我们的方法可以显著提高估计IT服务交易的成本和价格的准确性。
{"title":"A method for estimating annual cost reduction of IT service deals","authors":"Kugamoorthy Gajananan, Aly Megahed, Shubhi Asthana, V. Becker, Taiga Nakamura, Mark A. Smith","doi":"10.1109/SOLI.2017.8120967","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120967","url":null,"abstract":"Highly valued Information technology (IT) service contracts involve the delivery of complex IT services, such as migrating the client's IT infrastructure to the Cloud, Mainframes, among others. IT service providers usually compete to win these IT service contracts. In order to bid on such deals, IT service providers need to price/quote the solution that they propose to the client, trying to convince him to use their services. A few analytical methods in the literature have been provided for pricing these deals. However, these methods ignore an important characteristic of these services; that is they are typically characterized by a decreasing cost profile in subsequent years to the first year. Typically, these methods require solutioners to manually input these annual cost reductions. In this paper, we present an analytical way for calculating this cost reduction, if applicable, via mining historical data. We show that using our methodology could achieve significant increase in the accuracy of estimating the costs and prices of IT service deals.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125382968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A two-echelon facility location problem with stochastic demands for urban construction logistics: An application within the SUCCESS project 城市建设物流随机需求的两梯队设施选址问题:在SUCCESS项目中的应用
M. dell’Amico, Stefano Novellani
In this paper we present a two-echelon facility location problem with stochastic demands for the introduction of consolidation centers in the construction supply chain in urban areas. We describe the state of the art and propose a 2-stage model solved with L-shaped algorithms where several novel features are treated all together. The study is part of simulations performed during the European project SUCCESS (Sustainable Urban Consolidation CentrES for construction).
本文针对城市建筑供应链中整合中心的引入,提出了一个具有随机需求的两梯次设施选址问题。我们描述了目前的技术状况,并提出了一个用l形算法求解的两阶段模型,其中几个新特征被一起处理。这项研究是欧洲项目SUCCESS(可持续城市建设整合中心)模拟的一部分。
{"title":"A two-echelon facility location problem with stochastic demands for urban construction logistics: An application within the SUCCESS project","authors":"M. dell’Amico, Stefano Novellani","doi":"10.1109/SOLI.2017.8120976","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120976","url":null,"abstract":"In this paper we present a two-echelon facility location problem with stochastic demands for the introduction of consolidation centers in the construction supply chain in urban areas. We describe the state of the art and propose a 2-stage model solved with L-shaped algorithms where several novel features are treated all together. The study is part of simulations performed during the European project SUCCESS (Sustainable Urban Consolidation CentrES for construction).","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122228374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
A pre-process clustering methods for the waste collection problem 一种针对垃圾收集问题的预处理聚类方法
Angelo Parchitelli, Francesco Nocera, G. Iacobellis, M. Mongiello, T. D. Noia, E. Sciascio
Modern cities produce larger amounts of waste causing profound negative impacts on our natural environment. For this reason, processes related to waste collection, transportation, transformation and final disposal have increased their importance and major adequacy is desirable. Several Waste Management (WM) problems have to be solved in order to obtain efficient related services. Traditional Vehicle Routing Problem and Waste Collection Problem solution approaches presented in the literature are not suitable to face problems related to specific topology of the city, districts, street dimension and shape of the clusters. In this paper we propose a pre-process cluster solution in order to take into account different information such as street names, street dimension and civic number in order to create cluster more acceptable by the final users. In order to show the effectiveness of the proposed methodology, we compare hierarchical and spectral clustering-based algorithms. Finally, we apply our proposal in a real case study based on a data set extracted from a city in the north-east of Italy.
现代城市产生了大量的垃圾,对我们的自然环境造成了深刻的负面影响。因此,与废物收集、运输、改造和最后处置有关的过程增加了它们的重要性,最好是充分充分。为了获得有效的相关服务,必须解决废物管理(WM)的几个问题。文献中提出的传统的车辆路径问题和垃圾收集问题的解决方法不适合面对与城市特定拓扑、区域、街道尺寸和集群形状相关的问题。在本文中,我们提出了一种预处理集群解决方案,以考虑不同的信息,如街道名称,街道尺寸和市民号码,以创建更容易被最终用户接受的集群。为了证明所提出方法的有效性,我们比较了基于层次聚类和基于谱聚类的算法。最后,我们将我们的建议应用到一个真实的案例研究中,该案例研究基于从意大利东北部一个城市提取的数据集。
{"title":"A pre-process clustering methods for the waste collection problem","authors":"Angelo Parchitelli, Francesco Nocera, G. Iacobellis, M. Mongiello, T. D. Noia, E. Sciascio","doi":"10.1109/SOLI.2017.8121001","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8121001","url":null,"abstract":"Modern cities produce larger amounts of waste causing profound negative impacts on our natural environment. For this reason, processes related to waste collection, transportation, transformation and final disposal have increased their importance and major adequacy is desirable. Several Waste Management (WM) problems have to be solved in order to obtain efficient related services. Traditional Vehicle Routing Problem and Waste Collection Problem solution approaches presented in the literature are not suitable to face problems related to specific topology of the city, districts, street dimension and shape of the clusters. In this paper we propose a pre-process cluster solution in order to take into account different information such as street names, street dimension and civic number in order to create cluster more acceptable by the final users. In order to show the effectiveness of the proposed methodology, we compare hierarchical and spectral clustering-based algorithms. Finally, we apply our proposal in a real case study based on a data set extracted from a city in the north-east of Italy.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114100141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A decentralized control strategy for optimal charging of electric vehicle fleets with congestion management 基于拥堵管理的电动汽车最优充电分散控制策略
Raffaele Carli, M. Dotoli
This paper proposes a novel decentralized control strategy for the optimal charging of a large-scale fleet of Electric Vehicles (EVs). The scheduling problem aims at ensuring a cost-optimal profile of the aggregated energy demand and at satisfying the resource constraints depending both on power grid components capacity and EV locations in the distribution network. The resulting optimization problem is formulated as a quadratic programming problem with a coupling of decision variables both in the objective function and in the inequality constraints. The solution approach relies on a decentralized optimization algorithm that is based on a variant of ADMM (Alternating Direction Method of Multipliers), adapted to take into account the inequality constraints and the non-separated objective function. A simulated case study demonstrates that the approach allows achieving both the overall fleet and individual EV goals, while complying with the power grid congestion limits.
针对大型电动汽车的最优充电问题,提出了一种新的分散控制策略。调度问题的目的是确保总能源需求的成本最优,并满足取决于电网组件容量和电动汽车在配电网中的位置的资源约束。所得到的优化问题被表述为一个具有目标函数和不等式约束的决策变量耦合的二次规划问题。求解方法依赖于一种基于ADMM(乘数交替方向法)变体的分散优化算法,该算法适应于考虑不等式约束和非分离目标函数。一个模拟案例研究表明,该方法可以在满足电网拥堵限制的情况下,同时实现整个车队和单个电动汽车的目标。
{"title":"A decentralized control strategy for optimal charging of electric vehicle fleets with congestion management","authors":"Raffaele Carli, M. Dotoli","doi":"10.1109/SOLI.2017.8120971","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120971","url":null,"abstract":"This paper proposes a novel decentralized control strategy for the optimal charging of a large-scale fleet of Electric Vehicles (EVs). The scheduling problem aims at ensuring a cost-optimal profile of the aggregated energy demand and at satisfying the resource constraints depending both on power grid components capacity and EV locations in the distribution network. The resulting optimization problem is formulated as a quadratic programming problem with a coupling of decision variables both in the objective function and in the inequality constraints. The solution approach relies on a decentralized optimization algorithm that is based on a variant of ADMM (Alternating Direction Method of Multipliers), adapted to take into account the inequality constraints and the non-separated objective function. A simulated case study demonstrates that the approach allows achieving both the overall fleet and individual EV goals, while complying with the power grid congestion limits.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"4 33","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120926176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
An auction-based approach for the coordination of vehicles in automated warehouse systems 基于拍卖的自动化仓库系统车辆协调方法
F. Basile, P. Chiacchio, E. D. Marino
Automated warehouse systems play a key role in manufacturing systems and are currently controlled using hierarchical and centralized control architectures. The Interface system between the picking and storage area represents the most critical subsystem in automated warehouse systems and needs breakdown robustness and scalability. These requirements suggests the development of decentralized control solutions. However, the development of effective decentralized control solutions for these systems, which requires the coordination of vehicles moving along a monodimensional guide-path, is still a complex task. At this aim, an agent based approach using a sealed-bid auction mechanism is proposed in this paper.
自动化仓库系统在制造系统中起着关键作用,目前使用分层和集中控制体系结构进行控制。拣货区与存储区之间的接口系统是自动化仓库系统中最关键的子系统,它需要健壮性和可扩展性。这些要求建议开发分散控制解决方案。然而,为这些系统开发有效的分散控制解决方案仍然是一项复杂的任务,因为这些系统需要车辆沿着一维引导路径进行协调。为此,本文提出了一种基于代理的密封竞价拍卖方法。
{"title":"An auction-based approach for the coordination of vehicles in automated warehouse systems","authors":"F. Basile, P. Chiacchio, E. D. Marino","doi":"10.1109/SOLI.2017.8120981","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120981","url":null,"abstract":"Automated warehouse systems play a key role in manufacturing systems and are currently controlled using hierarchical and centralized control architectures. The Interface system between the picking and storage area represents the most critical subsystem in automated warehouse systems and needs breakdown robustness and scalability. These requirements suggests the development of decentralized control solutions. However, the development of effective decentralized control solutions for these systems, which requires the coordination of vehicles moving along a monodimensional guide-path, is still a complex task. At this aim, an agent based approach using a sealed-bid auction mechanism is proposed in this paper.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134402327","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Post-production analysis approach for drone delivery fleet 无人机配送机队的后期分析方法
Asma Troudi, S. Addouche, S. Dellagi, A. E. Mhamedi
This paper treats a drone delivery parcel's problematic in an urban area. The civil application of drone has been developed during these last decades especially drone delivery applications. In this paper, we focus on drone delivery application in the urban area for last-mile parcel delivery. The new issue is not only the drone design but also the logistics support of a massive fleet of drones with a mission to deliver parcels in a dense urban area. We hereby treat problematic by focusing on Logistics Support System. In this context, the commercialized drone is a considered as a system on the shelf. we propose a Post-Production Logistics Support Analysis to cover the exploitation phase of a drone delivery operator.
本文研究了无人机投递包裹在城市地区的问题。无人机的民用应用在近几十年来得到了发展,尤其是无人机的送货应用。本文主要研究了无人机在城市地区的最后一英里包裹配送应用。新的问题不仅是无人机的设计,还有大规模无人机舰队的后勤支持,这些无人机的任务是在人口稠密的城市地区运送包裹。我们在此通过关注物流支持系统来处理问题。在这种情况下,商业化的无人机被认为是一个货架上的系统。我们提出了一个生产后的物流支持分析,以涵盖无人机交付运营商的开发阶段。
{"title":"Post-production analysis approach for drone delivery fleet","authors":"Asma Troudi, S. Addouche, S. Dellagi, A. E. Mhamedi","doi":"10.1109/SOLI.2017.8120986","DOIUrl":"https://doi.org/10.1109/SOLI.2017.8120986","url":null,"abstract":"This paper treats a drone delivery parcel's problematic in an urban area. The civil application of drone has been developed during these last decades especially drone delivery applications. In this paper, we focus on drone delivery application in the urban area for last-mile parcel delivery. The new issue is not only the drone design but also the logistics support of a massive fleet of drones with a mission to deliver parcels in a dense urban area. We hereby treat problematic by focusing on Logistics Support System. In this context, the commercialized drone is a considered as a system on the shelf. we propose a Post-Production Logistics Support Analysis to cover the exploitation phase of a drone delivery operator.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123782491","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
期刊
2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1