In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used t...In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.展开更多
The capacitated lot sizing and scheduling problem that involves indetermining the production amounts and release dates for several items over a given planning horizonare given to meet dynamic order demand without incu...The capacitated lot sizing and scheduling problem that involves indetermining the production amounts and release dates for several items over a given planning horizonare given to meet dynamic order demand without incurring backloggings. The problem consideringovertime capacity is studied. The mathematical model is presented, and a genetic algorithm (GA)approach is developed to solve the problem. The initial solutions are generated after usingheuristic method. Capacity balancing procedure is employed to stipulate the feasibility of thesolutions. In addition, a technique based on Tabu search (TS) is inserted into the genetic algorithmdeal with the scheduled overtime and help the convergence of algorithm. Computational simulation isconducted to test the efficiency of the proposed hybrid approach, which turns out to improve boththe solution quality and execution speed.展开更多
In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location factories to minimize the total costs of production, inventory and transportation under the system capacity restricti...In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location factories to minimize the total costs of production, inventory and transportation under the system capacity restriction and product due date, while at the same time considering the menu distributed balance, the mathematical programming models are decomposed and reduced from the 3 levels into 2 levels according to the idea of just-in-time production. In order to overcome the premature convergence of ACA (ant colony algorithms), the idea of mute operation is adopted in genetic algorithms and a PACA (parallel ant colony algorithms) is proposed for supply chain optimization. Finally, an illustrative example is given, and a comparison is made with standard BAB (Branch and Bound) and PACA approach. The result shows that the latter is more effective and promising.展开更多
Capacitated vehicle routing problem (CVRP) is an important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high ...Capacitated vehicle routing problem (CVRP) is an important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. A hybrid algorithm was developed to solve the problem, in which an artificial immune clonal algorithm (AICA) makes use of the global search ability to search the optimal results and simulated annealing (SA) algorithm employs certain probability to avoid becoming trapped in a local optimum. The results obtained from the computational study show that the proposed algorithm is a feasible and effective method for capacitated vehicle routing problem.展开更多
In this article, we propose novel reformulations for capacitated lot sizing problem. These reformulations are the result of reducing the number of variables (by eliminating the backorder variable) or increasing the nu...In this article, we propose novel reformulations for capacitated lot sizing problem. These reformulations are the result of reducing the number of variables (by eliminating the backorder variable) or increasing the number of constraints (time capacity constraints) in the standard problem formulation. These reformulations are expected to reduce the computational time complexity of the problem. Their computational efficiency is evaluated later in this article through numerical analysis on randomly generated problems.展开更多
Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational comp...Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid ap- proximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimiza- tion (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.展开更多
Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we giv...Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we give a “vertical decomposition” approach to solve SSCWLP that uses Lagrangian relaxation. This way SSCWLP is broken into two versions of capacitated plant location problem (the CPLP_L and CPLP_R) by relaxing the flow balance constraints. For CPLP_R, we use well known Lagrangian relaxations given in literature (Christofides and Beasley [5] and Nauss [6]);and adopt them suitably for solving CPLP_L. We show theoretically in this paper that SSCWLP can be more efficiently solved by techniques of vertical decomposition developed in this paper than the method available in literature (Sharma and Berry [4]). Encouraging computational study is reported in this paper.展开更多
It is shown that when backorders, setup times and dynamic demand are included in capacitated lot sizing problem, the resulting classical formulation and one of the transportation formulations of the problem (referred ...It is shown that when backorders, setup times and dynamic demand are included in capacitated lot sizing problem, the resulting classical formulation and one of the transportation formulations of the problem (referred to as CLSP_BS) are equivalent. And it is shown that both the formulations are “weak” formulations (as opposed to “strong” formulation). The other transportation version is a strong formulation of CLSP_BS. Extensive computational studies are presented for medium and large sized problems. In case of medium-sized problems, strong formulation produces better LP bounds, and takes lesser number of branch-and-bound (B&B) nodes and less CPU time to solve the problem optimally. However for large-sized problems strong formulation takes more time to solve the problem optimally, defeating the benefit of strength of bounds. This essentially is because of excessive increase in the number of constraints for the large sized problems. Hybrid formulations are proposed where only few most promising strong constraints are added to the weak formulation. Hybrid formulation emerges as the best performer against the strong and weak formulations. This concept of hybrid formulation can efficiently solve a variety of complex real life large-sized problems.展开更多
Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variabl...Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method;it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.展开更多
We consider a capacitated location-allocation problem in the presence of k connections on the horizontal line barrier. The objective is to locate a set of new facilities among a set of existing facilities and to alloc...We consider a capacitated location-allocation problem in the presence of k connections on the horizontal line barrier. The objective is to locate a set of new facilities among a set of existing facilities and to allocate an optimal number of existing facilities to each new facility in order to satisfy their demands such that the summation of the weighted rectilinear barrier distances from new facilities to existing facilities is minimized. The proposed problem is designed as a mixed-integer nonlinear programming model. To show the efficiency of the model, a numerical example is provided. It is worth noting that the global optimal solution is obtained.展开更多
The objective of this study was to test the use of a commercial extender (Triladyl) as a diluent in caprine semen refrigerated at 15℃, using caffeine (CF), heparin (HP), synthetic oviductal fluid (SOF) andtriladyl (T...The objective of this study was to test the use of a commercial extender (Triladyl) as a diluent in caprine semen refrigerated at 15℃, using caffeine (CF), heparin (HP), synthetic oviductal fluid (SOF) andtriladyl (TRY) as capacitating chemical agents at different times. Twenty ejaculates of caprine semen were collected using an artificial vagina. The ejaculates were diluted and refrigerated by three days. Evaluated the progressive motility (PM) and the functional state of the sperm plasma membrane trough fluorescent CTC staining, counting 200 spermatic cells (non-capacitated spermatozoa NCS, capacitated CS and reacting spermatozoa REA) of caprine in two capacitating agents: CAF and HEP;one culture medium:SOF and a commercial extender: TRY at 60, 120, 180 and 240 min of incubation, during 24, 48 and 72 hs. PM was high under TRY, and CS was high under the HEP treatment. TRY could be an alternative to capacitate caprine spermatozoa, keeping PM for a longer time than HEP or CAF.展开更多
We investigate the single-client capacitated facility location problem with operational cost budget constraint.Specifically speaking,we are given a single client with demand,a set of potential facilities with capaciti...We investigate the single-client capacitated facility location problem with operational cost budget constraint.Specifically speaking,we are given a single client with demand,a set of potential facilities with capacities,and a positive integer specifying the operational cost budget.For each open facility,one should pay its opening cost and operational cost.For each open facility to service the client,one should pay the service cost.The objective is to open enough facilities serving the client’s demand and satisfying the capacity and operational cost budget constraints while minimizing the sum of opening and service costs.In this paper,based on dynamic programming and sparse techniques,we derive a fully polynomial time approximation scheme(FPTAS)with violating the operational cost budget constraint at most an arbitrarily small factor or claim that there is no feasible solution.展开更多
Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have...Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have a potential facilities set and a clients set.Each facility has a certain capacity and an open cost,and each client has a spliitable demand that need to be met.The goal is to open some facilities and assign all clients to these open facilities so that the total cost is as low as possible.The CFLP is NP-hard(non-deterministic polynomial-hard),and a large amount of work has been devoted to designing approximation algorithms for CFLP and its variants.Following this vein,we introduce a new variant of CFLP called capacitated uniform facility location problem with soft penalties(CUFLPSP),in which the demand of each client can be partially rejected by paying penalty costs.As a result,we present a linear programming-rounding(LP-rounding)based 5.5122-approximation algorithm for the CUFLPSP.展开更多
Raw water temperature can fluctuate significantly throughout the year,with peaks above 30℃in summer and below 15℃in winter.Traditional desalination systems(e.g.,reverse osmosis,RO)face challenges under these varying...Raw water temperature can fluctuate significantly throughout the year,with peaks above 30℃in summer and below 15℃in winter.Traditional desalination systems(e.g.,reverse osmosis,RO)face challenges under these varying temperature conditions.Specifically,while the RO system performs well under high temperatures,its efficiency decreases sharply at lower temperatures.Membrane capacitive deionization(MCDI)is considered as an emergent and promising technology for brackish water desalination.While plenty of studies have been devoted to investigating the impacts of raw water properties(e.g.,salinity,coexisting ions,and natural organic matter)on MCDI performance,the role of water temperatures during the desalination remains under-explored.In this study,we first tested and determined the optimized MCDI operation parameters,such as the cell voltage and feedwater flow rate.Key findings showed that MCDI’s salt removal efficiency remains unaffected by feedwater temperature fluctuations.However,as feedwater temperature increases from 15℃to 40℃,the specific energy consumption for desalination slightly rises by 16.3%,and current efficiency drops by 14.1%.Compared to RO systems,the resilience of MCDI to temperature fluctuations makes it a preferable choice for brackish water treatment in areas with a large temperature difference.展开更多
Fabric-based pressure sensors offer high stability,low energy consumption,and excellent wearing com-fort,making them promise intelligent wearable devices and health monitoring.However,creating a fabric-based capacitiv...Fabric-based pressure sensors offer high stability,low energy consumption,and excellent wearing com-fort,making them promise intelligent wearable devices and health monitoring.However,creating a fabric-based capacitive pressure sensor that integrates high sensitivity,wide detection range,good air breathability,water vapour permeability,and low cost remains a challenge.In this study,a sensor two-scale synergistic resistive/capacitive hybrid response model is developed to analyze the sensor response factors at different pressing stages.It is proposed that fabric metal silver electrodes be prepared using the microdroplet jetting technology,combined with the sacrificial template method and mixed doping of active materials to prepare the dielectric layer.Results indicate the sensor achieves a high sensitivity of 2.872 kPa−1within a pressure range of 0-1 kPa,with an average air breathability of 61.69 mm/s and water vapour permeability of 3075.01 g/m224 h.Its applications in human motion monitoring and human-computer interaction highlight its potential in wearable technology.展开更多
The rational design of high-performance electrochemical energy storage devices critically depends on a fundamental understanding of ion-electrode interactions at the molecular scale.Herein,we employ interpretable mach...The rational design of high-performance electrochemical energy storage devices critically depends on a fundamental understanding of ion-electrode interactions at the molecular scale.Herein,we employ interpretable machine learning(ML)to reveal electrolyte hydration energy as a universal descriptor governing ion-specific capacitance in two-dimensional(2D)materials.Through explainable ML,we elucidate how ion hydration shell stability and size critically influence charge transport and storage at the electrode-electrolyte interface.Our analysis identifies hydration energy-not ionic size-as the primary factor dictating capacitance,challenging prevailing assumptions and providing quantifiable design rules for electrolyte selection.These insights offer a data-driven pathway to optimize 2D materials for supercapacitors and beyond,including batteries and electrocatalytic systems.This work demonstrates the power of explainable artificial intelligence in uncovering molecular-level mechanisms that accelerate the discovery and development of next-generation energy storage technologies.展开更多
Polyurethane(PU)holds promise as a matrix for electrorheological elastomers(EREs)because of its excellent mechanical properties;however,its high modulus often limits electrorheological(ER)efficiency.This study address...Polyurethane(PU)holds promise as a matrix for electrorheological elastomers(EREs)because of its excellent mechanical properties;however,its high modulus often limits electrorheological(ER)efficiency.This study addresses this by tailoring the soft-segment architecture of PU to adjust its mechanical and dielectric properties,thus improving the ER response of the PU-based ERE.Dynamic covalent bonds have also been introduced to enable self-healing.Using poly(propylene glycol)(PPG),poly(tetramethylene glycol)(PTMG),and polycaprolactone(PCL)as the soft segments,we fabricated EREs with 20 wt%TiO2.The resulting PPG-ERE exhibited an outstanding ER effect of 229.4%at 3 kV/mm,along with a high stretchability(1835%elongation)and tensile strength of 3.6 MPa.PTMG-ERE has the highest storage modulus of 1.43 MPa at 3 kV/mm and a relatively high tensile strength of up to 6.5 MPa,which is attributed to enhanced hydrogen bonding interactions among the regular PTMG segments.The PCL-ERE with the highest Young's modulus resulted in the lowest ER efficiency of 48%because of its high crystallization tendency.The PPG-ERE also demonstrated efficient self-healing,recovering 79%of its mechanical strength after 12 h at room temperature.When applied in a capacitive pressure sensor,the PPG-ERE showed a fast response(220 ms)and recovery(90 ms),detecting forces as low as 3 N.This study provides a practical strategy for designing high-performance multifunctional EREs through soft-segment engineering and dynamic bonding.展开更多
Nanocomposite technology is an effective strategy to enhance the performance of capacitive deionization(CDI).However,the poor interfacial interactions between the nanofillers and matrices limit their further optimizat...Nanocomposite technology is an effective strategy to enhance the performance of capacitive deionization(CDI).However,the poor interfacial interactions between the nanofillers and matrices limit their further optimization and commercial application.Here,we developed an interface engineering strategy to prepare a high-strength and high-toughness fiber electrode based on holey reduced graphene oxide(HRGO)and carboxylated carbon nanotubes(CCNT)through introducing borate bonds as bridging interactions.The interface interaction between HRGO and CCNT is significantly enhanced by the formation of dynamic cross-linked borate bonds,which not only effectively preventπ-πstacking and construct hierarchical ion transport channels to enhance ion transport efficiency and reaction kinetics,but also significantly improve mechanical stability and long-cycle performance based on self-healing properties in the fiber electrode.This configuration showed remarkably enhanced desalination capacity(30.6 mg g-1)and higher desalination rate(6.12 mg g-1 min-1),with cycling performance exceeding 90%,which exceeds previously reported values.Density functional theory calculations further reveal the mechanism by which the nanocomposite interface affects the CDI performance.Based on this excellent performance,we established a recirculating desalination hydrogen production system consisting of multiple CDI units connected in series with a hydrogen production unit.This effective strategy opens a new way to optimize the nanocomposite interfaces and achieve efficient electrochemical reactions.展开更多
Flexible proximity-tactile sensors have attracted significant attention for enhancing robotic perception.Among them,capacitive flexible proximity−tactile dual-mode sensor arrays are rapidly becoming a key solution.How...Flexible proximity-tactile sensors have attracted significant attention for enhancing robotic perception.Among them,capacitive flexible proximity−tactile dual-mode sensor arrays are rapidly becoming a key solution.However,existing sensor arrays are limited by their physical configurations and electrical interconnects,making it difficult to achieve high resolution and large detection depth simultaneously.To overcome the limited detection depth of traditional capacitive sensor arrays,this work introduces a novel tri-mode architecture with a distance-sensing mode,extending the maximum detection depth by up to 104.56%compared to a single sensor unit.Inspired by near-pupil reflection,a pupil-like layer was integrated into the traditional dual-mode sensor to realize high-resolution and tunable detection depth simultaneously.By introducing a fractal electrode design to enhance the fringing field,the sensitivity of proximity and tactile sensing is significantly improved.Additionally,sacrificial template methods are used to fabricate microporous structures in the electrodes and dielectric layers,enabling high sensitivity(3.38×10-2 pF·kPa-1)over a broad pressure range(0−22.7 kPa),a wide detection limit(0-400 kPa),and large capacitance variation(>2.8 pF).The sensor array achieves high resolution and tunable detection depth(24.36−49.83 mm)and a large sensing distance(>90 mm).By stacking the proposed sensor array,the sweeping robot and humanoid robot demonstrate multi-level safety perception,obstacle recognition,gesture detection,and proximal target localization.This work addresses the fundamental trade-off between resolution and detection depth in capacitive flexible dual-mode proximity−tactile sensors,advancing robotic perception and interaction capabilities and paving a broad pathway for the practical deployment of future multi-mode sensors.展开更多
Polymer matrix composites with high dielectric constants and low dielectric losses are in high demand for flexible electronics.However,simultaneously satisfying these requirements poses a significant scientific challe...Polymer matrix composites with high dielectric constants and low dielectric losses are in high demand for flexible electronics.However,simultaneously satisfying these requirements poses a significant scientific challenge owing to the intrinsic trade-off relationship.Herein,we utilized the in situ controllable reduction of graphene oxide(GO)within a poly(vinylidene fluoride-trifluoroethylene-chlorofluoroethylene)(P(VDF-Tr FE-CFE))matrix to regulate the dielectric properties.The as-obtained composite exhibited a high relative dielectric constant of 1415coupled with a low loss tangent of 0.380 at 100 Hz.Experimental and theoretical studies indicate that the increased degree of electron conjugation and conductivity of the reduced GO(RGO)are responsible for the high-k.The constrained reduction degree of GO,combined with its homogeneous dispersion in the polymer matrix,effectively suppresses long-range charge carrier migration,thereby minimizing dielectric loss.This novel strategy could be successfully applied to both organic and aqueous systems.Furthermore,a high-performance flexible capacitive proximity sensor was exemplified by the optimization of both the dielectric layer and electrode pattern,exhibiting excellent sensitivity and stability.The fundamental mechanisms elucidated in this study provide crucial design principles for developing dielectric PMCs with tailored properties,thereby opening new avenues for advanced flexible electronic applications.展开更多
基金supported by the National Science Fund for Distinguished Young Scholars of China(61525304)the National Natural Science Foundation of China(61873328)
摘要In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.
基金This project is supported by National Natural Science Foundation of China (No.70071017, No.60074011) the Open-lab of Manufacturing System Engineering, Xi'an Jiaotong University, China.
摘要The capacitated lot sizing and scheduling problem that involves indetermining the production amounts and release dates for several items over a given planning horizonare given to meet dynamic order demand without incurring backloggings. The problem consideringovertime capacity is studied. The mathematical model is presented, and a genetic algorithm (GA)approach is developed to solve the problem. The initial solutions are generated after usingheuristic method. Capacity balancing procedure is employed to stipulate the feasibility of thesolutions. In addition, a technique based on Tabu search (TS) is inserted into the genetic algorithmdeal with the scheduled overtime and help the convergence of algorithm. Computational simulation isconducted to test the efficiency of the proposed hybrid approach, which turns out to improve boththe solution quality and execution speed.
摘要In order to study the capacitated lot sizing problem for a supply chain of corporate multi-location factories to minimize the total costs of production, inventory and transportation under the system capacity restriction and product due date, while at the same time considering the menu distributed balance, the mathematical programming models are decomposed and reduced from the 3 levels into 2 levels according to the idea of just-in-time production. In order to overcome the premature convergence of ACA (ant colony algorithms), the idea of mute operation is adopted in genetic algorithms and a PACA (parallel ant colony algorithms) is proposed for supply chain optimization. Finally, an illustrative example is given, and a comparison is made with standard BAB (Branch and Bound) and PACA approach. The result shows that the latter is more effective and promising.
摘要Capacitated vehicle routing problem (CVRP) is an important combinatorial optimization problem. However, it is quite difficult to achieve an optimal solution with the traditional optimization methods owing to the high computational complexity. A hybrid algorithm was developed to solve the problem, in which an artificial immune clonal algorithm (AICA) makes use of the global search ability to search the optimal results and simulated annealing (SA) algorithm employs certain probability to avoid becoming trapped in a local optimum. The results obtained from the computational study show that the proposed algorithm is a feasible and effective method for capacitated vehicle routing problem.
摘要In this article, we propose novel reformulations for capacitated lot sizing problem. These reformulations are the result of reducing the number of variables (by eliminating the backorder variable) or increasing the number of constraints (time capacity constraints) in the standard problem formulation. These reformulations are expected to reduce the computational time complexity of the problem. Their computational efficiency is evaluated later in this article through numerical analysis on randomly generated problems.
基金Project (No. 60174009) supported by the National Natural ScienceFoundation of China
摘要Capacitated vehicle routing problem (CVRP) is an NP-hard problem. For large-scale problems, it is quite difficult to achieve an optimal solution with traditional optimization methods due to the high computational complexity. A new hybrid ap- proximation algorithm is developed in this work to solve the problem. In the hybrid algorithm, discrete particle swarm optimiza- tion (DPSO) combines global search and local search to search for the optimal results and simulated annealing (SA) uses certain probability to avoid being trapped in a local optimum. The computational study showed that the proposed algorithm is a feasible and effective approach for capacitated vehicle routing problem, especially for large scale problems.
摘要Single Stage Capacitated Warehouse Location Problem (SSCWLP) has been attempted by few researchers in the past. These are Geoffrion and Graves [1], Sharma [2], Sharma [3] and Sharma and Berry [4]. In this paper we give a “vertical decomposition” approach to solve SSCWLP that uses Lagrangian relaxation. This way SSCWLP is broken into two versions of capacitated plant location problem (the CPLP_L and CPLP_R) by relaxing the flow balance constraints. For CPLP_R, we use well known Lagrangian relaxations given in literature (Christofides and Beasley [5] and Nauss [6]);and adopt them suitably for solving CPLP_L. We show theoretically in this paper that SSCWLP can be more efficiently solved by techniques of vertical decomposition developed in this paper than the method available in literature (Sharma and Berry [4]). Encouraging computational study is reported in this paper.
摘要It is shown that when backorders, setup times and dynamic demand are included in capacitated lot sizing problem, the resulting classical formulation and one of the transportation formulations of the problem (referred to as CLSP_BS) are equivalent. And it is shown that both the formulations are “weak” formulations (as opposed to “strong” formulation). The other transportation version is a strong formulation of CLSP_BS. Extensive computational studies are presented for medium and large sized problems. In case of medium-sized problems, strong formulation produces better LP bounds, and takes lesser number of branch-and-bound (B&B) nodes and less CPU time to solve the problem optimally. However for large-sized problems strong formulation takes more time to solve the problem optimally, defeating the benefit of strength of bounds. This essentially is because of excessive increase in the number of constraints for the large sized problems. Hybrid formulations are proposed where only few most promising strong constraints are added to the weak formulation. Hybrid formulation emerges as the best performer against the strong and weak formulations. This concept of hybrid formulation can efficiently solve a variety of complex real life large-sized problems.
摘要Our research focuses on the development of two cooperative approaches for resolution of the multi-item capacitated lot-sizing problems with time windows and setup times (MICLSP-TW-ST). In this paper we combine variable neighborhood search and accurate mixed integer programming (VNS-MIP) to solve MICLSP-TW-ST. It concerns so a particularly important and difficult problem in production planning. This problem is NP-hard in the strong sense. Moreover, it is very difficult to solve with an exact method;it is for that reason we have made use of the approximate methods. We improved the variable neighborhood search (VNS) algorithm, which is efficient for solving hard combinatorial optimization problems. This problem can be viewed as an optimization problem with mixed variables (binary variables and real variables). The new VNS algorithm was tested against 540 benchmark problems. The performance of most of our approaches was satisfactory and performed better than the algorithms already proposed in the literature.
摘要We consider a capacitated location-allocation problem in the presence of k connections on the horizontal line barrier. The objective is to locate a set of new facilities among a set of existing facilities and to allocate an optimal number of existing facilities to each new facility in order to satisfy their demands such that the summation of the weighted rectilinear barrier distances from new facilities to existing facilities is minimized. The proposed problem is designed as a mixed-integer nonlinear programming model. To show the efficiency of the model, a numerical example is provided. It is worth noting that the global optimal solution is obtained.
摘要The objective of this study was to test the use of a commercial extender (Triladyl) as a diluent in caprine semen refrigerated at 15℃, using caffeine (CF), heparin (HP), synthetic oviductal fluid (SOF) andtriladyl (TRY) as capacitating chemical agents at different times. Twenty ejaculates of caprine semen were collected using an artificial vagina. The ejaculates were diluted and refrigerated by three days. Evaluated the progressive motility (PM) and the functional state of the sperm plasma membrane trough fluorescent CTC staining, counting 200 spermatic cells (non-capacitated spermatozoa NCS, capacitated CS and reacting spermatozoa REA) of caprine in two capacitating agents: CAF and HEP;one culture medium:SOF and a commercial extender: TRY at 60, 120, 180 and 240 min of incubation, during 24, 48 and 72 hs. PM was high under TRY, and CS was high under the HEP treatment. TRY could be an alternative to capacitate caprine spermatozoa, keeping PM for a longer time than HEP or CAF.
基金supported by the National Natural Science Foundation of China(Nos.11971252 and 12261039)the Ningbo Natural Science Foundation(No.2022J146).
摘要We investigate the single-client capacitated facility location problem with operational cost budget constraint.Specifically speaking,we are given a single client with demand,a set of potential facilities with capacities,and a positive integer specifying the operational cost budget.For each open facility,one should pay its opening cost and operational cost.For each open facility to service the client,one should pay the service cost.The objective is to open enough facilities serving the client’s demand and satisfying the capacity and operational cost budget constraints while minimizing the sum of opening and service costs.In this paper,based on dynamic programming and sparse techniques,we derive a fully polynomial time approximation scheme(FPTAS)with violating the operational cost budget constraint at most an arbitrarily small factor or claim that there is no feasible solution.
基金supported by the National Natural Science Foundation of China(Nos.11971349,12071442,12371320,and 12371318).
摘要Capacitated facility location problem(CFLP)is a classical combinatorial optimization problem that has various applications in operations research,theoretical computer science,and management science.In the CFLP,we have a potential facilities set and a clients set.Each facility has a certain capacity and an open cost,and each client has a spliitable demand that need to be met.The goal is to open some facilities and assign all clients to these open facilities so that the total cost is as low as possible.The CFLP is NP-hard(non-deterministic polynomial-hard),and a large amount of work has been devoted to designing approximation algorithms for CFLP and its variants.Following this vein,we introduce a new variant of CFLP called capacitated uniform facility location problem with soft penalties(CUFLPSP),in which the demand of each client can be partially rejected by paying penalty costs.As a result,we present a linear programming-rounding(LP-rounding)based 5.5122-approximation algorithm for the CUFLPSP.
基金supported by the National Natural Science Foundation of China(Nos.52370090,52300016)China Postdoctoral Science Foundation(Nos.2023M733379,2024M753122).
摘要Raw water temperature can fluctuate significantly throughout the year,with peaks above 30℃in summer and below 15℃in winter.Traditional desalination systems(e.g.,reverse osmosis,RO)face challenges under these varying temperature conditions.Specifically,while the RO system performs well under high temperatures,its efficiency decreases sharply at lower temperatures.Membrane capacitive deionization(MCDI)is considered as an emergent and promising technology for brackish water desalination.While plenty of studies have been devoted to investigating the impacts of raw water properties(e.g.,salinity,coexisting ions,and natural organic matter)on MCDI performance,the role of water temperatures during the desalination remains under-explored.In this study,we first tested and determined the optimized MCDI operation parameters,such as the cell voltage and feedwater flow rate.Key findings showed that MCDI’s salt removal efficiency remains unaffected by feedwater temperature fluctuations.However,as feedwater temperature increases from 15℃to 40℃,the specific energy consumption for desalination slightly rises by 16.3%,and current efficiency drops by 14.1%.Compared to RO systems,the resilience of MCDI to temperature fluctuations makes it a preferable choice for brackish water treatment in areas with a large temperature difference.
基金financially supported by the China Postdoctoral Science Foundation(No.2023M732827)the Natural Science Basic Research Program of Shaanxi(No.2023-JC-QN-0510)+2 种基金the Scientific Research Program Funded by Shaanxi Provincial Education Depart-ment(No.21JK0649)the Scientific Research Foundation for Doctor of Xi’an Polytechnic University(No.BS202057)the Innova-tion Foundation for Graduate of Xi’an Polytechnic University(No.chx2024007).
摘要Fabric-based pressure sensors offer high stability,low energy consumption,and excellent wearing com-fort,making them promise intelligent wearable devices and health monitoring.However,creating a fabric-based capacitive pressure sensor that integrates high sensitivity,wide detection range,good air breathability,water vapour permeability,and low cost remains a challenge.In this study,a sensor two-scale synergistic resistive/capacitive hybrid response model is developed to analyze the sensor response factors at different pressing stages.It is proposed that fabric metal silver electrodes be prepared using the microdroplet jetting technology,combined with the sacrificial template method and mixed doping of active materials to prepare the dielectric layer.Results indicate the sensor achieves a high sensitivity of 2.872 kPa−1within a pressure range of 0-1 kPa,with an average air breathability of 61.69 mm/s and water vapour permeability of 3075.01 g/m224 h.Its applications in human motion monitoring and human-computer interaction highlight its potential in wearable technology.
基金supported by Iran National Science Foundation(INSF)under project No.4022382Facilities were provided by the Condensed Matter National Laboratory at the Institute for Research in Fundamental Sciences(IPM)in Tehran,Iran.Additionally,financial support for equipment purchase was granted by the INSF under project number 4022382.
摘要The rational design of high-performance electrochemical energy storage devices critically depends on a fundamental understanding of ion-electrode interactions at the molecular scale.Herein,we employ interpretable machine learning(ML)to reveal electrolyte hydration energy as a universal descriptor governing ion-specific capacitance in two-dimensional(2D)materials.Through explainable ML,we elucidate how ion hydration shell stability and size critically influence charge transport and storage at the electrode-electrolyte interface.Our analysis identifies hydration energy-not ionic size-as the primary factor dictating capacitance,challenging prevailing assumptions and providing quantifiable design rules for electrolyte selection.These insights offer a data-driven pathway to optimize 2D materials for supercapacitors and beyond,including batteries and electrocatalytic systems.This work demonstrates the power of explainable artificial intelligence in uncovering molecular-level mechanisms that accelerate the discovery and development of next-generation energy storage technologies.
基金financially supported by the National Natural Science Foundation of China(No.52372293)the S&T Program of Hebei Province(No.244A1001D)。
摘要Polyurethane(PU)holds promise as a matrix for electrorheological elastomers(EREs)because of its excellent mechanical properties;however,its high modulus often limits electrorheological(ER)efficiency.This study addresses this by tailoring the soft-segment architecture of PU to adjust its mechanical and dielectric properties,thus improving the ER response of the PU-based ERE.Dynamic covalent bonds have also been introduced to enable self-healing.Using poly(propylene glycol)(PPG),poly(tetramethylene glycol)(PTMG),and polycaprolactone(PCL)as the soft segments,we fabricated EREs with 20 wt%TiO2.The resulting PPG-ERE exhibited an outstanding ER effect of 229.4%at 3 kV/mm,along with a high stretchability(1835%elongation)and tensile strength of 3.6 MPa.PTMG-ERE has the highest storage modulus of 1.43 MPa at 3 kV/mm and a relatively high tensile strength of up to 6.5 MPa,which is attributed to enhanced hydrogen bonding interactions among the regular PTMG segments.The PCL-ERE with the highest Young's modulus resulted in the lowest ER efficiency of 48%because of its high crystallization tendency.The PPG-ERE also demonstrated efficient self-healing,recovering 79%of its mechanical strength after 12 h at room temperature.When applied in a capacitive pressure sensor,the PPG-ERE showed a fast response(220 ms)and recovery(90 ms),detecting forces as low as 3 N.This study provides a practical strategy for designing high-performance multifunctional EREs through soft-segment engineering and dynamic bonding.
基金supported by the National Key R&D Program of China(2022YFA1200075)the Shanghai pilot Program for Basic Research(grant no.22TQ1400100-8)+2 种基金the Shanghai Pujiang Program(grant no.20PJ1402500)the Natural Science Foundation of Shanghai(grant no.22ZR1416600)the Fundamental Research Funds for the Central Universities.
摘要Nanocomposite technology is an effective strategy to enhance the performance of capacitive deionization(CDI).However,the poor interfacial interactions between the nanofillers and matrices limit their further optimization and commercial application.Here,we developed an interface engineering strategy to prepare a high-strength and high-toughness fiber electrode based on holey reduced graphene oxide(HRGO)and carboxylated carbon nanotubes(CCNT)through introducing borate bonds as bridging interactions.The interface interaction between HRGO and CCNT is significantly enhanced by the formation of dynamic cross-linked borate bonds,which not only effectively preventπ-πstacking and construct hierarchical ion transport channels to enhance ion transport efficiency and reaction kinetics,but also significantly improve mechanical stability and long-cycle performance based on self-healing properties in the fiber electrode.This configuration showed remarkably enhanced desalination capacity(30.6 mg g-1)and higher desalination rate(6.12 mg g-1 min-1),with cycling performance exceeding 90%,which exceeds previously reported values.Density functional theory calculations further reveal the mechanism by which the nanocomposite interface affects the CDI performance.Based on this excellent performance,we established a recirculating desalination hydrogen production system consisting of multiple CDI units connected in series with a hydrogen production unit.This effective strategy opens a new way to optimize the nanocomposite interfaces and achieve efficient electrochemical reactions.
基金supported by the National Key Research and Development Project(No.2020YFB1711300)the National Natural Science Foundation of China(No.51905178)+1 种基金the Natural Science Foundation of Guangdong Province,China(No.2021B1515020087)the Fundamental Research Funds for the Central Universities,SCUT.
摘要Flexible proximity-tactile sensors have attracted significant attention for enhancing robotic perception.Among them,capacitive flexible proximity−tactile dual-mode sensor arrays are rapidly becoming a key solution.However,existing sensor arrays are limited by their physical configurations and electrical interconnects,making it difficult to achieve high resolution and large detection depth simultaneously.To overcome the limited detection depth of traditional capacitive sensor arrays,this work introduces a novel tri-mode architecture with a distance-sensing mode,extending the maximum detection depth by up to 104.56%compared to a single sensor unit.Inspired by near-pupil reflection,a pupil-like layer was integrated into the traditional dual-mode sensor to realize high-resolution and tunable detection depth simultaneously.By introducing a fractal electrode design to enhance the fringing field,the sensitivity of proximity and tactile sensing is significantly improved.Additionally,sacrificial template methods are used to fabricate microporous structures in the electrodes and dielectric layers,enabling high sensitivity(3.38×10-2 pF·kPa-1)over a broad pressure range(0−22.7 kPa),a wide detection limit(0-400 kPa),and large capacitance variation(>2.8 pF).The sensor array achieves high resolution and tunable detection depth(24.36−49.83 mm)and a large sensing distance(>90 mm).By stacking the proposed sensor array,the sweeping robot and humanoid robot demonstrate multi-level safety perception,obstacle recognition,gesture detection,and proximal target localization.This work addresses the fundamental trade-off between resolution and detection depth in capacitive flexible dual-mode proximity−tactile sensors,advancing robotic perception and interaction capabilities and paving a broad pathway for the practical deployment of future multi-mode sensors.
基金financially supported by the Innovation and Technology Commission of the Hong Kong SAR Government(No.MRP/020/21)Hong Kong Polytechnic University(No.847A)+1 种基金RI-Wear Seed Fund of Poly U(1-CD8J)Start-up Fund of Poly U(1-BD49)。
摘要Polymer matrix composites with high dielectric constants and low dielectric losses are in high demand for flexible electronics.However,simultaneously satisfying these requirements poses a significant scientific challenge owing to the intrinsic trade-off relationship.Herein,we utilized the in situ controllable reduction of graphene oxide(GO)within a poly(vinylidene fluoride-trifluoroethylene-chlorofluoroethylene)(P(VDF-Tr FE-CFE))matrix to regulate the dielectric properties.The as-obtained composite exhibited a high relative dielectric constant of 1415coupled with a low loss tangent of 0.380 at 100 Hz.Experimental and theoretical studies indicate that the increased degree of electron conjugation and conductivity of the reduced GO(RGO)are responsible for the high-k.The constrained reduction degree of GO,combined with its homogeneous dispersion in the polymer matrix,effectively suppresses long-range charge carrier migration,thereby minimizing dielectric loss.This novel strategy could be successfully applied to both organic and aqueous systems.Furthermore,a high-performance flexible capacitive proximity sensor was exemplified by the optimization of both the dielectric layer and electrode pattern,exhibiting excellent sensitivity and stability.The fundamental mechanisms elucidated in this study provide crucial design principles for developing dielectric PMCs with tailored properties,thereby opening new avenues for advanced flexible electronic applications.