Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Chao Liu Li, E. Yuanke Li |
| Copyright Year | 2013 |
| Description | Author affiliation: Inst. of Syst. Sci., Northeastern Univ., Shenyang, China (Chao Liu) || Sch. of Math. & Stat., Northeastern Univ. at Qinhuangdao, Qinhuangdao, China (Li, E.; Yuanke Li) |
| Abstract | The waste transfer station allocation optimization of urban life is an important part in the process of garbage disposal. According to M/M/S queuing model and relevant statistical data, waste transfer station allocation of Qinhuangdao is investigated based on queuing service system in this paper. The proposed model is studied by using computer simulation, and simulation results reveal that there are some disadvantages for the existing resources and services management, such as the average queue length lasts for bigger, and the customer usually waits for a long time. In view of the above shortcomings, queuing theory method is utilized for allocation optimization research. In the case of compression equipment number is 2, optimal service rate μ* = 11.1516 is obtained in this paper, which is higher than the current service rate and the cost of queuing service system in waste transfer station can be reduced by improving the service rate. Furthermore, in the case of service rate unchanged, the optimal service number s* = 3 is obtained and a compression equipment can be applied in the model to make the system optimized. Finally, numerical simulations are carried out to show efficiency of the theoretical analysis obtained in this paper. |
| Sponsorship | IEEE Control Syst. Soc. |
| Starting Page | 1521 |
| Ending Page | 1524 |
| File Size | 238280 |
| Page Count | 4 |
| File Format | |
| ISBN | 9781467355339 |
| e-ISBN | 9781467355346 |
| DOI | 10.1109/CCDC.2013.6561169 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2013-05-25 |
| Publisher Place | China |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Computational modeling Cities and towns Educational institutions Optimal service rate Queuing theory Waste transfer station Mathematical model Optimal service number Queueing analysis Optimization Vehicles Matlab |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|